task_name stringclasses 757
values | id stringlengths 40 41 | definition stringclasses 746
values | inputs stringlengths 1 289k | targets stringlengths 0 4.29k |
|---|---|---|---|---|
task919_coqa_incorrect_answer_generation | task919-28836a8fa55d43538403e57e8caa73e9 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: CHAPTER III
_Danny Meadow Mouse Plays Hide and Seek_
Life is always a game of hide and seek to Danny Meadow Mouse. You see, he is such a fat little fellow that there are a great many other furry-coated people, and almost as many who wear feathers, who would gobble Danny up for breakfast or for dinner if they... | a Meadow Mouse |
task919_coqa_incorrect_answer_generation | task919-bb0716a424a5415084dd4a21e159e6c3 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: A Texas teen who's been jailed more than four months for a Facebook comment he made during a video-game argument is finally getting a day in court that could let him go home.
Justin Carter, who was 18 when he was arrested, will appear in Comal County (Texas) District Court on Tuesday, July 16, for a bond heari... | A Texas teen |
task919_coqa_incorrect_answer_generation | task919-9ffe887482ef4d4d9e69d1b6e2f806e5 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Chris Waddell wants to climb Kilimanjaro in a wheelchair; George Del Barrio wants to make a film in Cambodia; Jeff Edwards wants to write a book: they want you to fund their dreams.
A website called Kickstarter.com is making it possible for people like this to raise money from a few hundred to tens of thousand... | Kilimanjaro |
task919_coqa_incorrect_answer_generation | task919-9d172f3ac3d94444be277b4116b0c85b | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Every day Yang Hongwei takes the bus home from work, staring silently at the European-style villas , luxury cars and twinkling lights from the shopping center that he sees through the window.
Yang works for a software company in Zhongguancun. He dreams of such a life, away from poverty, and that hope has kept ... | Yang Hongwei |
task919_coqa_incorrect_answer_generation | task919-e03a04b134674aa988fc47d91dcbb57c | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: CHAPTER VIII
A MYSTERIOUS LETTER
In the morning mail Gus Plum received a letter postmarked London which he read with much interest. Then he called on Dave.
"I've just received a letter I want you to read," he said. "It is from Nick Jasniff, and he mentions you." And he handed over the communication.
It w... | Nick Jasniff |
task919_coqa_incorrect_answer_generation | task919-915f0f79185049db8ea24eac4817eece | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: (CNN) -- Jason Priestley played Brandon Walsh on "Beverly Hills 90210" from 1990 to 1998. Having long since hung up his Peach Pit uniform and Beverly Hills Beach Club cabana boy polo shirt, his character became a journalist and departed to take a job at the Washington Bureau of the New York Chronicle, and Priest... | Jason Priestley |
task919_coqa_incorrect_answer_generation | task919-c1b549b19450468a9e6d3c6bb3bdd6a5 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: CHAPTER 62
This recognition of Rome by Lothair evinced not only a consciousness of locality, but an interest in it not before exhibited; and the monsignore soon after seized the opportunity of drawing the mind of his companion to the past, and feeling how far he now realized the occurrences that immediately pr... | Lothair |
task919_coqa_incorrect_answer_generation | task919-e5cd1e9bb1274cfcae230dd16d4d2d79 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: CHAPTER XII.
Madame Colonna, with that vivacious energy which characterises the south, had no sooner seen Coningsby, and heard his praises celebrated by his grandfather, than she resolved that an alliance should sooner or later take place between him and her step-daughter. She imparted her projects without del... | eighteen |
task919_coqa_incorrect_answer_generation | task919-7704bf68735b492ea788d16dac4c13c2 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Do you know more and more Chinese artists have made regular donations to charity or put their efforts into charity work in China? Here let's know some of them. Faye Wong and her husband Li Yapeng started the Yan Ran Angel Foundation for harelipped children three years ago. It was named after their daughter. Its ... | Yan Ran Angel Foundation |
task919_coqa_incorrect_answer_generation | task919-aa00fc8dc00741cdbfc5ec70f9159511 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Probably no other musical instrument is as popular as the guitar around the world. Musicians use the guitar for almost all kinds of music. Country and western music would not be the same without a guitar. The traditional Spanish folk music called Flamenco could not exist without a guitar. The sound of American b... | the guitar |
task919_coqa_incorrect_answer_generation | task919-a2e3df79cc52463989b9489e8b96e29f | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: It's not just gloves that can help people keep warm in winter. Love can, too. A pair of 16-year-old American twins, Jack and Jake Moran, stared a program called "Warm Hearts, Warm Hands" last month. Their aim was to collect new and used gloves with fellow students at Richards High School. "We started this progra... | new and used gloves |
task919_coqa_incorrect_answer_generation | task919-5c86343c883e4178a8286a063d9f45cb | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: (CNN) -- "L.A. Law" had buzz right from the moment it premiered in 1986.
Co-created by Steven Bochco, hot off his success with "Hill Street Blues," the series was set at the high-priced Los Angeles law firm of McKenzie, Brackman, Chaney and Kuzak.
The cast was glossy and diverse, including Jimmy Smits, Blair... | rape, capital punishment, big business |
task919_coqa_incorrect_answer_generation | task919-52fa2c047a38492182004a86edf368e5 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Kiss of Death is a romantic detective story whose basic theme focuses totally on dogs.
Whitney Marshall had just gone through a divorce, appearing practically penniless while her husband, a promising plastic surgeon, was left with the property and the debts, and his new wife. Whitney seeks help from her cousin... | Adam Hunter |
task919_coqa_incorrect_answer_generation | task919-004ce239085f442daeadd4360234dbd4 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Jamie Oliver has been invited by Gordon Brown to prepare a banquet at No.10 for President Barack Obama and other leaders of the G20, offering a cut-price menu to reflect times when trade and industry are far from prosperous and the rate of employment is decreasing.
Downing Street sources say Oliver, the well-k... | Gordon Brown |
task919_coqa_incorrect_answer_generation | task919-b4b411881e7c4e99b99eaff7d9f09894 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Ultratop is an organization which generates and publishes the official record charts in Belgium, and it is also the name of most of those charts. Ultratop is a non-profit organization, created on the initiative of the Belgian Entertainment Association (BEA), the Belgian member organization of the International F... | around 500 |
task919_coqa_incorrect_answer_generation | task919-5f0b382da97142ae888e06b42814b5a8 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Brave Frenchman Found Half-way Around the World
(NEW YORK) A French tourist highly praised for rescuing a two-year-old girl in Manhattan said he didn't think twice before diving into the freezing East River.
Tuesday's Daily News said 29-year who left the spot quickly after the rescue last Saturday.
He lift... | The Daily News |
task919_coqa_incorrect_answer_generation | task919-aa55764180914aaf8c4515919a578363 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Once there was a group of adventurers who went on an adventure in a place named Hyperion where there was a lot of snow. Their names were Thor, Bravos, and Pierre. Thor and Bravos were from Norway, but Pierre was from Paris, France. Because of where he was from, he wasn't used to the cold. To stay warm, Pierre wo... | adventurers |
task919_coqa_incorrect_answer_generation | task919-67a903dbd5eb4d1b8daf49a2f9d446df | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: James VI and I (James Charles Stuart; 19 June 1566 – 27 March 1625) was King of Scotland as James VI from 24 July 1567 and King of England and Ireland as James I from the union of the Scottish and English crowns on 24 March 1603 until his death. The kingdoms of Scotland and England were individual sovereign stat... | Yes |
task919_coqa_incorrect_answer_generation | task919-3ba07c205b94487bb223f66288df06d0 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Intel Corporation (also known as Intel, stylized as intel) is an American multinational corporation and technology company headquartered in Santa Clara, California (colloquially referred to as "Silicon Valley") that was founded by Gordon Moore (of Moore's law fame) and Robert Noyce. It is the world's second larg... | Details about Intel Corporation |
task919_coqa_incorrect_answer_generation | task919-87eda550231a42c4847d16b4d575b902 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: (CNN) -- ISIS has released a new video of British hostage John Cantlie, this time showing him in the Syrian border city of Kobani.
In a segment that lasts for more than five minutes, Cantlie argues that -- unlike Western media accounts of recent days -- Kobani is mostly under control of the terror group, which... | ISIS |
task919_coqa_incorrect_answer_generation | task919-6a7b70c6c7994fe891504920dbf590e1 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: The Crimean War was a military conflict fought between October 1853 – March 1856 in which Russia lost to an alliance of France, the United Kingdom, the Ottoman Empire, and Sardinia. The immediate cause involved the rights of Christian minorities in the Holy Land, which was controlled by the Ottoman Empire. The F... | yes |
task919_coqa_incorrect_answer_generation | task919-6a976567566a445ca6d1780476f4f4bb | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: (CNN)Prison life won't be pretty for Aaron Hernandez, the former NFL player and convicted murderer sentenced to life without parole.
After correction officers evaluate him, he will be shipped to Massachusetts' flagship maximum-security prison, one of the most high-tech jails in the United States with no histor... | Aaron Hernandez |
task919_coqa_incorrect_answer_generation | task919-85d0497e4ff94869a9cba15a7d8f051a | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: CHAPTER TWELVE.
SAGE CONVERSE BETWEEN HAKE AND BERTHA--BIARNE IS OUTWITTED--A MONSTER IS SLAIN, AND SAVAGES APPEAR ON THE SCENE.
Not long after this an event occurred which produced great excitement in the new settlement; namely, the appearance of natives in the woods. It occurred under the following circums... | Karlsefin |
task919_coqa_incorrect_answer_generation | task919-b40698b2151748c6a410836f11b5ea51 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Oakland is the largest city and the county seat of Alameda County, California, United States. A major West Coast port city, Oakland is the largest city in the East Bay region of the San Francisco Bay Area, the third largest city overall in the San Francisco Bay Area, the eighth largest city in California, and th... | They are ports, shipyards and thriving automobile manufacturing industry |
task919_coqa_incorrect_answer_generation | task919-43cca95a7de14182a63621b8f9eabb21 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Spiderman is one of the most famous comic book heroes of all time. He was created by Stan Lee in 1963 and was first introduced to the world in the pages of Marvel Comic Books. Spiderman's story is the story of Peter Parker, a child who lost his parents and lives with his aunt and uncle. Peter is a shy, quiet boy... | Spiderman |
task919_coqa_incorrect_answer_generation | task919-c076e801d19043118c009ac85b560cec | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: The term Muslim world, also known as Islamic world and the Ummah (Arabic: أمة, meaning "nation" or "community") has different meanings. In a religious sense, the Islamic Ummah refers to those who adhere to the teachings of Islam, referred to as Muslims. In a cultural sense, the Muslim Ummah refers to Islamic ci... | Islamic world |
task919_coqa_incorrect_answer_generation | task919-80b1037fd63d4a37809069959b32ff22 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: (CNN) -- A former hospital worker systematically shot and killed four people in upstate New York on Saturday, authorities in two counties said.
Former hospital worker Frank Garcia, 34, has been accused in the shooting rampage.
Frank Garcia, 34, was arrested Saturday afternoon. Garcia knew all four victims, p... | four |
task919_coqa_incorrect_answer_generation | task919-c9de993759694029bb519fb229c2ac5a | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Berlin is the capital and the largest city of Germany as well as one of its 16 constituent states. With a population of approximately 3.7 million, Berlin is the second most populous city proper in the European Union and the seventh most populous urban area in the European Union. Located in northeastern Germany o... | 16 |
task919_coqa_incorrect_answer_generation | task919-5a9e594e949246d0bf2ecebd34fe727c | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: (CNN) -- Samantha Stosur stopped Caroline Wozniacki from clinching the year-end women's No. 1 tennis ranking with a shock 6-4 6-3 victory at the WTA Championships in Qatar on Wednesday night.
The Australian romped to her second straight victory in the Maroon Group, following her revenge win over French Open ch... | Revenge win |
task919_coqa_incorrect_answer_generation | task919-153091a7f9834e9699619e2d2bd0e0ab | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Art lovers around the world have thought about this question for so many years: what is the secret behind the Mona Lisa's smile? However, they can ask Mona Lisa herself in the interactive exhibition in Beijing. This exhibition brings the 500-year-old painting to life. Now Leonardo da Vinci's famous painting can ... | the secret behind the Mona Lisa's smile |
task919_coqa_incorrect_answer_generation | task919-957a76d8812c422bbb0f90693e24fdb6 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: CHAPTER XXXIII. THE LAST JACOBITE RISING.
While the Kirk was vainly striving to assuage the tempers of Mr Erskine and his friends, the Jacobites were preparing to fish in troubled waters. In 1739 Walpole was forced to declare war against Spain, and Walpole had previously sounded James as to his own chances of ... | Charles |
task919_coqa_incorrect_answer_generation | task919-5a3258246f0e424ebdda50bd9b8e9199 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: (CNN) -- Serbia will face France in the final of the Davis Cup after a tense 3-2 semifinal victory over the Czech Republic in front of a passionate home support in Belgrade.
The Czechs led 2-1 after winning Saturday's doubles rubber, meaning the hosts had to claim victory in both reverse singles to secure thei... | France |
task919_coqa_incorrect_answer_generation | task919-da33cd8db2b54df4939e253aac996bf0 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Washington (CNN) -- At one time, Susan Rice seemed to be on a trajectory that would take her to the secretary of state's office in President Barack Obama's second term.
But that trajectory changed Thursday when the U.S. ambassador to the United Nations withdrew her name from consideration to succeed current Se... | Madeleine Albright |
task919_coqa_incorrect_answer_generation | task919-7f514673b659443ca8af96b70b6ea952 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: This summer Frank and his friends went to Boy Scout camp for two weeks. At camp they had lots of fun activities like swimming, wood carving, and telling ghost stories. At camp there weren't any restaurants or grocery stores, so for food they would have to make their own meals. One thing they could do is make pea... | Frank and his friends |
task919_coqa_incorrect_answer_generation | task919-9909f94b176849f08a9eda3c677caaca | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Logan had lots of toys. He had balls, dinosaurs, race cars, and even robots! Logan had so many toys he had a room for his toys. There he could play with whatever he wanted, when he wanted, and not even have to pick them back up. Logan had all kinds of balls. He had red ones, green ones, blue ones and even a pink... | toy room |
task919_coqa_incorrect_answer_generation | task919-5d369858a9e942b9ae267f45fcfd679b | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: CHAPTER XXXVI.
TOM TRINGLE GETS AN ANSWER.
Faddle as he went down into the country made up his mind that the law which required such letters to be delivered by hand was an absurd law. The post would have done just as well, and would have saved a great deal of trouble. These gloomy thoughts were occasioned by... | TOM TRINGLE GETS AN ANSWER. |
task919_coqa_incorrect_answer_generation | task919-9c89d0f8181242188761016b3cb63b75 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: CHAPTER XXX
FERN Mullins rushed into the house on a Saturday morning early in September and shrieked at Carol, "School starts next Tuesday. I've got to have one more spree before I'm arrested. Let's get up a picnic down the lake for this afternoon. Won't you come, Mrs. Kennicott, and the doctor? Cy Bogart want... | FERN Mullins |
task919_coqa_incorrect_answer_generation | task919-1ae57d32a35f4bfb9c9e3f75f3b1ee75 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Utah ( or ) is a state in the western United States. It became the 45th state admitted to the U.S. on January 4, 1896. Utah is the 13th-largest by area, 31st-most-populous, and 10th-least-densely populated of the 50 United States. Utah has a population of more than 3 million (Census estimate for July 1, 2016), a... | Yes |
task919_coqa_incorrect_answer_generation | task919-dd7bdc84b3d24b9f9587eb4424512195 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: The Legion of Honour, full name, National Order of the Legion of Honour (), is the highest French order of merit for military and civil merits, established in 1802 by Napoléon Bonaparte.
The order's motto is ' ("Honour and Fatherland") and its seat is the next to the Musée d'Orsay, on the left bank of the Rive... | Napoléon Bonaparte. |
task919_coqa_incorrect_answer_generation | task919-a9acc8f9ee59417889d690c250a81e9a | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: A music genre is a conventional category that identifies some pieces of music as belonging to a shared tradition or set of conventions. It is to be distinguished from "musical form" and "musical style", although in practice these terms are sometimes used interchangeably. Recently, academics have argued that cate... | different genres |
task919_coqa_incorrect_answer_generation | task919-ef6f5ffc85804c55af14a20b6725a85e | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: (CNN) -- Yoshinobu Miyake is perhaps the only athlete apart from Dick Fosbury who has had a technique named after him.
Miyake: the strongest man ever?
While Fosbury was throwing himself backward over the bar in the high jump in Mexico City 1968, Miyake was placing his ankles together, instead of apart, for t... | 1939 |
task919_coqa_incorrect_answer_generation | task919-08dec6bea6784113bc4511ffd01efafe | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Karachi (; ALA-LC: , ; ) is the capital of the Pakistani province of Sindh. It is the most populous city in Pakistan, sixth most populous city proper in the world and the 8th most populous metropolitan city in the world. Ranked as a beta world city, the city is Pakistan's premier industrial and financial centre.... | Sindh |
task919_coqa_incorrect_answer_generation | task919-15b2aaa5ca4c4a019cfc5fff951f6d4a | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: I'm writing this letter slowly because I know you can't read fast. We don't live where we did when you left home. Your dad read in the newspaper that most accidents happened within 20 miles from our home, so we moved.
I won't be able to send you the address because the last family that lived here took the hous... | within 20 miles from home |
task919_coqa_incorrect_answer_generation | task919-cb9087edb7954c4892ae36c2aff85a9a | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: The Federated States of Micronesia (; abbreviated FSM and also known simply as Micronesia) is an independent sovereign island nation and a United States associated state consisting of four states from west to east, Yap, Chuuk, Pohnpei and Kosraethat are spread across the Western Pacific Ocean. Together, the stat... | Palikir |
task919_coqa_incorrect_answer_generation | task919-c10d25370d7e4d6bbef37cee4ae94e0b | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Ibn Rushd (; 14 April 1126 – 10 December 1198), full name (), often Latinized as Averroes (), was a medieval Andalusian polymath. He wrote on logic, Aristotelian and Islamic philosophy, theology, the Maliki school of Islamic jurisprudence, psychology, political and Andalusian classical music theory, geography, m... | Córdoba, Al Andalus |
task919_coqa_incorrect_answer_generation | task919-a69bf3c34b4c49579143404ec7ebafd3 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: Omaha is the largest city in the state of Nebraska and the county seat of Douglas County. Omaha is located in the Midwestern United States on the Missouri River, about north of the mouth of the Platte River. Omaha is the anchor of the Omaha-Council Bluffs metropolitan area, which includes Council Bluffs, Iowa, a... | speculators |
task919_coqa_incorrect_answer_generation | task919-77032278bf8e43b7b9882cc042c79231 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: In 50 years of traveling, Colin McCorpuodale has visited every country in the world except three. And everywhere he goes, he sends himself a postcard. He always chooses a postcard with beautiful scenery . Usually he writes just a short message to himself. However, he wrote an interesting story on his latest one,... | Malians |
task919_coqa_incorrect_answer_generation | task919-eebce23568d54512ab6afae3cf4c86a2 | This task is about reading the given passage and the question, return an incorrect answer to the given question. | story: (CNN) -- Alexis Murphy was last seen at a gas station earlier this month, and though police have arrested a suspect in her abduction, his attorney tells a CNN affiliate his client split ways with the 17-year-old after a drug deal.
Her disappearance set off a search that extended for 30 miles outside of Lovings... | Alexis Murphy |
task921_code_x_glue_information_retreival | task921-ba96888e80134868b38c8dc625c24622 | This task is to find the number of 'For' loops present in the given cpp program. | /*
* 11.27.cpp
*
* Created on: 2011-11-27
* Author: Administrator
*/
int coun; // ???????
void depart(int n,int i)
{
int j;
if (n==1) coun++ ;
else for (j=i;j<=n;j++) //???j?? ??????
if (n%j==0) {depart(n/j,j);}
}
int main (){
int n,j;
cin>>n;
int b[n]; ... | 3 |
task921_code_x_glue_information_retreival | task921-434f137fba854c5fbc732a9453ceced5 | This task is to find the number of 'For' loops present in the given cpp program. | void main()
{
int n,a[100],i;
void fen(int a[],int x);
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
fen(a,n);
}
void fen(int a[],int x)
{
int k,b=2,c,t;
int look(int x,int y);
for(k=0;k<x;k++)
{
c=a[k];
t=look(c,b);
printf("%d\n",t);
}
}
int look(int x,int y)
{
int total=1,p;
if(x/y=... | 3 |
task921_code_x_glue_information_retreival | task921-a963f94f0fdd44c3a53ece263dc397ea | This task is to find the number of 'For' loops present in the given cpp program. | int prime(int n, int m )
{
int i,total=1;
if(n<m)return 0;
for(i=m;i<=n;i++)
{
if(n%i==0)
total+=prime(n/i,i);
}
return total;
}
void main()
{
int n,b[2000],b0,i;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&b0);
b[i]=prime(b0,2);
}
for(i=0;i<=n-2;i++)
{
printf("%d\n",b[i]);
}
pri... | 3 |
task921_code_x_glue_information_retreival | task921-852bc4a9c2fc4a09ad08ec04366474e4 | This task is to find the number of 'For' loops present in the given cpp program. | /*
*????HW7_10.cpp
*??????1100019007?
*???2012-11-14
*???1090 ????
*/
int factorize(int m,int k)
{
int c=1;//a=a???
if(m<4)return 1;//?m??4??1
for(int i=k;i<=sqrt(m);i++)if(!(m%i))c+=factorize(m/i,k>i?k:i);//????????????????an>an-1,???k???
return c;//?????
}
int main(int argc, char *argv[]){
... | 1 |
task921_code_x_glue_information_retreival | task921-3204262a5c964c439aabafcfa610991c | This task is to find the number of 'For' loops present in the given cpp program. | int main()
{
int n,i,fenjie(int x,int y),*a,re=0,j;//x?????????y???????????
scanf("%d",&n);
a=(int*)malloc(n*sizeof(int));
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
printf("%d\n",fenjie(a[i],2)+1);
}
ret... | 4 |
task921_code_x_glue_information_retreival | task921-3f72d699840c4b69b41e55cedb6168b5 | This task is to find the number of 'For' loops present in the given cpp program. | int f(int x,int y) //???????????????y?????????x????????
{int i,num=0;
int a[100];
int sum=0;
for(i=x;i<=sqrt(y);i++){
if(y%i==0) {num++;a[num]=1+f(i,y/i);}} //??????
for(i=1;i<=num;i++) {sum=sum+a[i];}
return sum;
}
int main(){
int n,x,i,b[100];
cin>>n; //?????????
for(i=1;i<=n;i++){cin>>x;b[i]=x;}
for(i=... | 4 |
task921_code_x_glue_information_retreival | task921-ad856c7607ca4ae5ae0a6f7bf5362542 | This task is to find the number of 'For' loops present in the given cpp program. | void qut(int a,int b); //????
int num=0; //?????????
int main()
{
int i,n,g[1000]; //?????????
cin>>n;
for(i=0;i<n;i++) //??????
cin>>g[i];
for(i... | 3 |
task921_code_x_glue_information_retreival | task921-6ba708af29be4460ae908c12c7cf1e1a | This task is to find the number of 'For' loops present in the given cpp program. | int f(int x,int y);// ??????x????????y?????????????????
int main()
{
int n,i,j,a,sum;
cin>>n;
for(i=1;i<=n;i++)//??
{
cin>>a;
sum=0; //???
for(j=1;j<=a;j++)
sum+=f(a,j); //??
cout<<sum<<endl; //??
}
return 0;
}
int f(int x,int y)//???
{
... | 3 |
task921_code_x_glue_information_retreival | task921-eb69158b18664f84b5492fd447654a28 | This task is to find the number of 'For' loops present in the given cpp program. | //*************************************************
//*file: 1000012912_006.cpp *
//*author: ??? *
//*date?2010.12.01 *
//*function????? *
//*************************************************
int sum(int); ... | 2 |
task921_code_x_glue_information_retreival | task921-7b347f1386a24470865dadcf34638a92 | This task is to find the number of 'For' loops present in the given cpp program. | /*
*?????
*???2010 - 12 - 07
*????????? ????
*/
int num(int,int,int);
int qufen(int);
int power(int,int);
int main()
{
int t;
cin >> t;
while(t >= 1)
{
int n,i,x,sum = 1;
cin >> n;
x = qufen(n); //qufen????????????????????
for(i = 2; i <= x; i++)
sum = sum + num(n,i,2); //num??... | 5 |
task921_code_x_glue_information_retreival | task921-b23ff8d4b501495d8e7561c9e4faf7a8 | This task is to find the number of 'For' loops present in the given cpp program. | //*****************************
//* ??????? *
//* ?????? *
//* ???2010-12-7 *
//*****************************
int num=1,flag=2;//????1?????,?????
void way(int);
int main()
{
int a,n;
cin>>n;
while(n--)
{
cin>>a;
way(a);
cout<<num<<endl;
num=1;
flag=2;//???
}
return 0;
... | 1 |
task921_code_x_glue_information_retreival | task921-aafdd638fc444e3d9683c2b380dca596 | This task is to find the number of 'For' loops present in the given cpp program. | //*********************************
//* file?1.cpp
//* description: ????
//* author: ?? 1200012858
//* date: 2012-12-1
//*********************************
int decompose(int x, int y);
int main ()
{
int n, m;
cin >> n;
for (int j = 1; j <= n; j++)
{
cin >> m;
cout << decompose(m, 2) << endl;
}
return 0;
}
... | 2 |
task921_code_x_glue_information_retreival | task921-5b41f2d4f2a54dbd9a40e55e8a7c4b42 | This task is to find the number of 'For' loops present in the given cpp program. | void count(int, int);
int k;
int main()
{
int n, i, j, m;
int num;
cin >> n;
for (i = 0; i < n; i++)
{
k = 0;
cin >> num;
m = sqrt(num) + 1;
for (j = 2; j < m; j++)
if (num % j == 0)
{
k++;
count(num / j, j);
}
cout << k + 1 << endl;
}
return 0;
}
void count(int num, int i)
{
int j;
... | 3 |
task921_code_x_glue_information_retreival | task921-7de790a1bb444639bd95bdf55f336ae4 | This task is to find the number of 'For' loops present in the given cpp program. | int fenjie(int,int);
int main()
{
int times,k,num;
cin>>times;
for(k=1;k<=times;k++)
{
cin>>num;
cout<< fenjie(num,1)<<endl;
}
return 0;
}
int fenjie(int x,int y)
{
int i,a=1;
if(x<y) return 0;
if(x==y) return 1;
if(x>y)
{
if(y==1)
{
for(i=y+1;i<=x;i++)
{
if(x%i==0) a=a+fenjie(x/i,i);
... | 3 |
task921_code_x_glue_information_retreival | task921-ce3028c957f441829acc15f33211e764 | This task is to find the number of 'For' loops present in the given cpp program. |
int countt;
void f(int p,int q)
{
for(int m=p;m<=sqrt(q);m++)
{
if(q%m==0)
{countt++;
f(m,q/m);}
}
}
int main()
{
int n,num,i;
cin>>n;
for(i=0;i<n;i++)
{
cin>>num;
countt=0;
for(int k=2;k<=sqrt(num);k++)
{
if(num%k==0)
{
countt++;
f(k,num/k);
}
}
cout<<countt+1<... | 3 |
task921_code_x_glue_information_retreival | task921-e0586d377855448b952797f0b587571b | This task is to find the number of 'For' loops present in the given cpp program. | int tot;
void find(int m,int n)
{
int i,j,k;
if (m==1) tot=tot+1;
else
{
for (i=n;i<=m;i++)
if(m%i==0)
find (m/i,i);
}
}
int main()
{
int i,j,k,m,n;
cin >>n;
for (i=1;i<=n;i++)
{
tot=0;
cin >>m;
find(m,2);
cout <<... | 2 |
task921_code_x_glue_information_retreival | task921-08bf8e79572f44889d20aa52e5c94d30 | This task is to find the number of 'For' loops present in the given cpp program. | /*????
* divide.cpp
*
* Created on: 2011-12-1
* Author: WJ
*/
int sum=1; //?????1?????
void f(int b,int a) //??????????????
{
for(int i=b;i<=a;i++){ //????????
if((a%i==0)&&(i<=a/i)){
sum=sum+1; //???1
f(i,a/i); ... | 1 |
task921_code_x_glue_information_retreival | task921-77345157f6b64ed48452a586d6711430 | This task is to find the number of 'For' loops present in the given cpp program. | int f(int a,int min){
if(a<min)
return 0;
int sum=1;
for(int i=min;i<a;i++){
if(a%i==0)
sum+=f(a/i,i);
}
return sum;
}
int main(){
int n;
int a[100];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
a[i]=f(a[i],2);
}
for(int i=0;i<n;i++){
printf("%d\n",a[i]);
}
return 0;
}
| 3 |
task921_code_x_glue_information_retreival | task921-fcfa15cd74594ce6bd9f749ac48974f4 | This task is to find the number of 'For' loops present in the given cpp program. | /*
* ways.cpp
*
* Created on: 2013-11-24
* Author: Mac
*/
int factor(int a, int f)
{
if(a == f)
return 1;
if (a < f)
return 0;
if(a%f == 0)
return factor(a, f+1) + factor(a/f, f);
else return factor(a, f+1);
}
int main()
{
int x, a;
cin >> x;
while(x > 0)
{
cin >> a;
cout << factor(a, 2)... | 0 |
task921_code_x_glue_information_retreival | task921-61e7ce5950ff47f9ba252a41313db4eb | This task is to find the number of 'For' loops present in the given cpp program. |
int factor(int a,int min)
{
int count=0;
for(int i=min;i<=a;i++)
{
if(i==a)
{
count+=1;
}
if(a%i==0)
{
count+=factor(a/i,i);
}
}
return count;
}
int main()
{
int n;
cin>>n;
while(n--)
{
int a;
cin>>a;
int result=factor(a,2);
cout<<result<<endl;
}
return 0;
}
| 1 |
task921_code_x_glue_information_retreival | task921-a0b0d5a9b04a4925ae6081adec3ae6fe | This task is to find the number of 'For' loops present in the given cpp program. | int n, a, cnt = 0, num;
int decompose(int x, int y)
{
int i, xnum = 1;
if(x == 1)
return 0;
if(x == 2)
return 1;
for(i = y; i <= (int)sqrt(x); i++)
if(x % i == 0)
xnum += decompose(x / i, i);
return xnum;
}
int main()
{
cin >> n;
while(cnt < n)
{
... | 1 |
task921_code_x_glue_information_retreival | task921-5266ce3e25c74dabb4f3d6080ccac16d | This task is to find the number of 'For' loops present in the given cpp program. | /*
* 187.cpp
*
* Created on: 2011-11-22
* Author: think
*/
int count(int a,int n){
if(a>n)return 0;
if(a==n)return 1;
int p=1;
int i;
for(i=a;i<=n;i++){
if(n%i==0&&i<=n/i){
p=p+count(i,n/i);
}
}
return p;
}
int geshu(int N){
int i;
int s=1;
for(i=2;i<=sqrt(N);i++){
if(N%i==0){
s=s+count... | 4 |
task921_code_x_glue_information_retreival | task921-fb6cda1366474f61a24240df3aed8c67 | This task is to find the number of 'For' loops present in the given cpp program. | /*
* 1.cpp
*
* Created on: 2010-12-1
* Author: hanzhe
*/
int min(int a,int b){ //????
if(a>b)return b;
else return a;
}
int f(int n,int s){ //???????s?n???????
int k=0,i;
if(n==1)return 1;
else if(s==1)return 0;
else if(s>n)return f(n,n);
else {for(i=2;i<=s;i++)
if(n%i==0)k=k+f(n/i,min(i,s));
r... | 1 |
task921_code_x_glue_information_retreival | task921-c09c44ac9b5d41d0b6b5b0cf7412fa43 | This task is to find the number of 'For' loops present in the given cpp program. | int divide(int d,int n)
{
int sum=0;
for(int i=d;i<n;i++){
if (n%i==0&&(n/i)>=i){
sum=sum+1;
sum=sum+divide(i,n/i);}}
return (sum);
}
int main()
{
int n,num;
cin>>n;
for(int i=0;i<n;i++){
cin>>num;
cout<<divide(2,num)+1<<endl;}
return 0;
}
| 2 |
task921_code_x_glue_information_retreival | task921-f68fa6d4092b4a0b83031f0ce1eede33 | This task is to find the number of 'For' loops present in the given cpp program. | int t;//t???
void f(int n,int d)//n?????d???
{
int i;
if(n==1)//
t++;
else
{
for(i=d;i<=n;i++)
{
if(n%i==0)
{
f(n/i,i);
}
}
}
}
int main()
{
int number[100];
int n,i;
int result[100];
cin>>n;
for(i=0;i<n;i++)
{
cin>>number[i];
}
for(i=0;i<n;i++)
{
t=0;
f(number[i],2);
result[i... | 4 |
task921_code_x_glue_information_retreival | task921-0daa8ce87a954d179781be9a3894341e | This task is to find the number of 'For' loops present in the given cpp program. | int a[1000];
int l=0,x;
int fff(int w,int t);
int main()
{
int i,j,q,p,n,m,y;
scanf("%d",&n);
for(p=0;p<n;p++)
{q=1;l=0;
scanf("%d",&x);
for(i=2;i<=x;i++)
if(x%i==0)
{a[q]=i;
q++;
}
fff(q-1,1);
printf("%d\n",l);
... | 3 |
task921_code_x_glue_information_retreival | task921-4062d64c5d8e4293bf8069781c15b823 | This task is to find the number of 'For' loops present in the given cpp program. |
int s=0;
void find(int min,int dev)
{
int i;
for(i=min;i<=sqrt((float)dev);i++)
if(dev%i==0)
{
s++;
find(i,dev/i);
}
}
int main()
{
int n,i,m,j;
scanf("%d",&m);
for(j=1;j<=m;j++){
scanf("%d",&n);
for(i=2;i<=sqrt((float)n);i++)
... | 3 |
task921_code_x_glue_information_retreival | task921-1cfe7738d69f49b8a5d22867cefaac9f | This task is to find the number of 'For' loops present in the given cpp program. | int a[1000];
int l=0,x;
int fff(int w,int t,int x);
int main()
{
int i,j,q,p,n,m,y;
scanf("%d",&n);
for(p=0;p<n;p++)
{q=1;l=0;
scanf("%d",&x);
for(i=2;i<=x;i++)
if(x%i==0)
{a[q]=i;
q++;
}
fff(q-1,1,x);
printf("%d\n",l,x... | 3 |
task921_code_x_glue_information_retreival | task921-4e759e97dffa493f98832d1b3e4c0a94 | This task is to find the number of 'For' loops present in the given cpp program. | //*****************************************************
//*?????????.cpp *
//*?????? *
//*?????2010?12?8? *
//*???????????????? *
//*****************************************************
int answer=0;//???????
... | 3 |
task921_code_x_glue_information_retreival | task921-8f8fbfd6f47742cead412ec87c79a86e | This task is to find the number of 'For' loops present in the given cpp program. | /*
* ???? .cpp
*
* Created on: 2012-11-27
* Author:??
* ???????a?????????????????a = a1 * a2 * a3 * ... * an?
* ??1 < a1 <= a2 <= a3 <= ... <= an?????????????????a = a???????
*/
int answer = 0;//???????
void f(int n, int N) {
if (n < N)
N = n;//????????????
if (N == 1) {
answer++;//??????
... | 1 |
task921_code_x_glue_information_retreival | task921-3580b00f2b1e45c38472a007cee44f74 | This task is to find the number of 'For' loops present in the given cpp program. | /*int hf[32768][32768]={0};
int work(int m,int n)
{
if(hf[m][n]!=0)
return hf[m][n];
if(m%n!=0)
{
hf[m][n]=0;
return 0;
}
for(int i=n;i<=m/n;i++)
hf[m][n]+=work(m/n,i);
return hf[m][n];
}*/
int work(int m,int n)
{
if(m==n)
return 1;
if(m%n!=0)
return 0;
int sum=0;
for(int i=n;i<=m/n;i++)
sum+=work(m... | 4 |
task921_code_x_glue_information_retreival | task921-d9f40aaee2364b3db08bc89944ba7bee | This task is to find the number of 'For' loops present in the given cpp program. |
int divmet(int n,int i);
int main()
{
int n=0; //?????
int t=0; //????
int sum; //???????
cin>>t;
for(int i=0;i<t;i++)
{
sum=0;
cin>>n;
for(int j=2;j<=n;j++)
{
sum=sum+divmet(n,j);
}
cout<<sum<<endl;
}
return 0;
... | 3 |
task921_code_x_glue_information_retreival | task921-06b37435fe1b4db894ba54a38c4d26de | This task is to find the number of 'For' loops present in the given cpp program. | int make(int x,int t)
{
int ans=0,i;
if (x==1) return 1;
for (i=t;i<=x;i++)
if (x%i==0) ans+=make(x/i,i);
return ans;
}
int main()
{
int i,k,j,p,n,t,m,x;
scanf("%d",&t);
for (p=1;p<=t;p++)
{
scanf("%d",&n);
x=make(n,2);
printf("%d\n",x);
}
} | 2 |
task921_code_x_glue_information_retreival | task921-071ef330f1e64cb2860ab1f02c72e5fb | This task is to find the number of 'For' loops present in the given cpp program. | int main()
{
int f(int k,int m);
int n;
scanf("%d",&n);
int i;
for(i=1;i<=n;i++)
{
int k;
scanf("%d",&k);
printf("%d\n",f(k,2));
}
return 0;
}
int f(int k,int m)
{
int i;
int j=0;
if(k<=m)
{
if(k==m){
j=1;
return j;
}
else
{
j=0;
return j;
}
}
else
{
for(i=m;i<=k;i++)
{... | 2 |
task921_code_x_glue_information_retreival | task921-ce2b1b0b6dcb433180792978965b4f6b | This task is to find the number of 'For' loops present in the given cpp program. | int f(int n,int m)
{
int sum=1,i;
if(n<m)
sum=0;
else
if(n==m)
sum=1;
else
{
for(i=m;i<=n;i++)
if(n%i==0)
sum=sum+f(n/i,i);
}
return(sum);
}
void main()
{
int x,j,a[100000];
scanf("%d",&x);
for(j=0;j<x;j++)
scanf("%d",&a[j]);
for(j=0;j<x;j++)
printf("%d\n",f(a[j],2));
} ... | 3 |
task921_code_x_glue_information_retreival | task921-41aca1c91eb7434f89cf0244cb6a83c6 | This task is to find the number of 'For' loops present in the given cpp program. |
int chu(int i,int n);
int main()
{
int n,m,i,j;
int sum[100];
scanf("%d",&n);
for(i=0;i<=(n-1);i++)
{
scanf("%d",&m);
sum[i]=0;
for(j=2;j<=sqrt(m);j++)
{
if(m%j==0)
{
sum[i]+=chu(j,m/j);
}
}
}
for(i=0;i<=(n-1);i++)
{
printf("%d\n",sum[i]+1);
}
}
int chu(int i,int n)
{
int j,m,t... | 4 |
task921_code_x_glue_information_retreival | task921-cb497a23dd714c8eadb15d068d9274c6 | This task is to find the number of 'For' loops present in the given cpp program. |
int kind (int k,int a)
{
int i,j,temp=0;
int x;
for (i=a;i<k;i++)
{
if (i<=k/i&&k%i==0)
{
x=k/i;
// printf("%d*%d=%d\n",x,i,k);
temp++;
for (j=i;j<x;j++)
{
if (j<=x/j&&x%j==0)
... | 4 |
task921_code_x_glue_information_retreival | task921-f0a50c683a69451580d94b477a194d11 | This task is to find the number of 'For' loops present in the given cpp program. | int devide(int n,int k)
{
int s,i;
s=1;
for(i=k;i<=sqrt(n*1.0);i++)
{
if(n%i==0)
{
s=s+devide(n/i,i);
}
}
return s;
}
int main()
{
int n,a[200],i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(i==0)printf("%d",devide(a[i],2));
else printf("\n%d",devide(a[i],2));
}
return 0;
} | 2 |
task921_code_x_glue_information_retreival | task921-ccdb5f694c5a4787b3c12c97d5fe16ea | This task is to find the number of 'For' loops present in the given cpp program. | int qq(int m){
int i,j;
j=0;
for(i=2;i*i<=j;i++){
if(m%i==0){
j=1;
break;
}
}
return j;
}
int pp(int m,int j){
int i,k=0;
if(m==1)
return 1;
else {
k++;
for(i=j;i*i<=m;i++){
if(qq(i)==0&&m%i==0){
k=k+pp(m/i,i);
}
}
}
retur... | 4 |
task921_code_x_glue_information_retreival | task921-20ec4146e91c4933abd6e3191b41691f | This task is to find the number of 'For' loops present in the given cpp program. | int sum;
void zhongshu(int qian,int a);
int main()
{
int n,i,j,a[100];
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
{ sum=0;
zhongshu(2,a[i]);
cout<<sum<<endl;
}
return 0;
}
void zhongshu(int qian,int a)
{
int i,j,c;
if(a==1)
{
sum=sum+1;
return;
... | 3 |
task921_code_x_glue_information_retreival | task921-764b06c54ebd45cdb90a3f68134d0370 | This task is to find the number of 'For' loops present in the given cpp program. | //????????
//??????
int f(int a,int m) //???a???????m?????????
{
if(a<m)
return 0;
int kind=1;
for(int i=m;i<a;i++)
{
if(a%i==0) //??????????????
kind=kind+f(a/i,i);
}
return kind;
}
int main()
{
int n,a[100];
cin>>n;
for(int i=0;i<n;i++) //??n???
cin>>a[i];
fo... | 3 |
task921_code_x_glue_information_retreival | task921-c637a0ffa88141e48d73f3bdbbb78d32 | This task is to find the number of 'For' loops present in the given cpp program. | int fenjie(int max,int min)
{
int num=1,i,k;
for(i=min;i<max/2;i++)
{
k=max%i;
if(k==0)
{
if(i<=max/i)
num+=fenjie(max/i,i);
}
}
return num;
}
int main()
{
int a[10000],n,j;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("\n%d... | 3 |
task921_code_x_glue_information_retreival | task921-82b6c21bba64479c8a626b6b6e0b1d16 | This task is to find the number of 'For' loops present in the given cpp program. | //????
//2010?12?03?
//1000012753 ???
int deal(int num, int p)
{
int i, sum = 0;
if(num == 1)
return 1;
for(i = p; i <= num; ++i)
if(num % i == 0)
sum += deal(num / i, i);
return sum;
}
int main()
{
int n, a;
cin >> n;
while(n--)
{
cin >> a;
cout << deal(a, 2) << endl;
}
return 0;
}
| 1 |
task921_code_x_glue_information_retreival | task921-35e3a765ce08413d8d80c0af8d703c58 | This task is to find the number of 'For' loops present in the given cpp program. | int im(int n,int max)
{
int s=0,i;
if(n==1)
return 1;
for(i=max;i>1;i--)
if(n%i==0)
s+=im(n/i,i);
return s;
}
int main()
{
int i,n,t;
scanf("%d%d",&n,&t);
printf("%d",im(t,t));
for(i=1;i<n;i++)
{
scanf("%d",&t);
printf("\n%d",im(t,t... | 2 |
task921_code_x_glue_information_retreival | task921-5c86aac5be324cc498028b7ce51faf52 | This task is to find the number of 'For' loops present in the given cpp program. |
int fg(int k,int m)
{
int j,d=0;
if (m==1)
{
d=1;
}
for(j=k;j<=m;j++)
{
if (m%j==0)
d=d+fg(j,m/j);
}
return(d);
}
int main()
{
int n,i,a[40000],b[40000],s;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<=n;i++)
{
b[i]=fg(2,a[i]);
printf("%d\n",b[i]);
}
retu... | 3 |
task921_code_x_glue_information_retreival | task921-92f9b7d0dbb2497c873ba8c9b25d10b8 | This task is to find the number of 'For' loops present in the given cpp program. | int sushu(int b)
{
int flag=1,i;
if(b==2)
return 1;
if(b%2==0)
return 0;
for(i=2;i<=b/2;i++)
{
if(b%i==0)
{
flag=0;
break;
}
}
if(flag==0)
return 0;
else
return 1;
}
int number(int a,int b)
{
int i,total=1;
if(sushu(a))
{
total=1;
return total;
}
for(i=b;i<=a;i++)
{
if(a%i==0... | 4 |
task921_code_x_glue_information_retreival | task921-4ae52ac2dd8646958bc07cd5f42ea95c | This task is to find the number of 'For' loops present in the given cpp program. | void factor(int,int);
int result[9999]={0};
int j=0;
int main()
{
int times,k=1;
cin>>times;
while(k<=times){
int num,ansf=0;
cin>>num;
factor(2,num);
for(int i=0;i<9999;i++)
if(result[i])ansf++;
cout<<ansf<<endl;
for(int i=0;i<9999;i++)
result[i]=0;
k++;
}
return 0;
}
void factor(int start,int nu... | 3 |
task921_code_x_glue_information_retreival | task921-da823d2f7b98408fa00f0b0af3693d4a | This task is to find the number of 'For' loops present in the given cpp program. | int k=0;
int y;
int a(int x,int i);
void b(int x,int i);
int main()
{
int n,i,x,z;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&x);
y=x;
printf("%d\n",a(x,2));
}
return 0;
}
int a(int x,int i)
{
k=0;
b(x,i);
return k;
}
void b(int x,int i)
{
for(i=i;i<=x;i++)
{
if(x%i==0) b(x/i,i);
}
if(x==1) k=... | 2 |
task921_code_x_glue_information_retreival | task921-f0284fabe8eb48489e96f34fc66aa20f | This task is to find the number of 'For' loops present in the given cpp program. | int t;
void tot(int,int);
int main()
{
int n,a[100],i;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<=n;i++) {
t = 0;
tot(a[i],2);
cout<<t<<endl;
}
return 0;
}
void tot(int x, int min)
{ int k;
if(x==1) {
++t;
return;
}
for(k=min;k<=x;k++)
if(x%k==0)
{
tot(x/k, k);
}
} | 3 |
task921_code_x_glue_information_retreival | task921-78b2acaafa774e2690f0ed8ab9938df7 | This task is to find the number of 'For' loops present in the given cpp program. | int num=0;
void f(int x,int y)
{
num++;
for(int j=y;j*j<=x;j++)
{
if(x%j==0)
f(x/j,j);
}
}
int main()
{
int n;
cin>>n;
int a[1100];
for(int i=1;i<=n;i++)
{
num=0;
cin>>a[i];
f(a[i],2);
cout<<num<<endl;
... | 2 |
task921_code_x_glue_information_retreival | task921-ed341b04217848bebc82dd29c38e9080 | This task is to find the number of 'For' loops present in the given cpp program. | int ispr(int t)
{
int v=sqrt(t*1.0)+1;
for(int i=2; i<v; i++)
if(t%i==0)
return 0;
return 1;
}
int sum=0;
void fun(int n,int i) {
if(n==1)
sum++;
while(i<=n) {
if(n%i==0)
fun(n/i,i);
i++;
}
return ;
}
int main() {
int n;
... | 1 |
task921_code_x_glue_information_retreival | task921-de16b40057b54a4288bf57193dfb3cfc | This task is to find the number of 'For' loops present in the given cpp program. | /*
* ????1118-4.cpp
* ?????
* ????: 2011-11-29
* ??????????a?????????????????a = a1 * a2 * a3 * ... * an???1 < a1 <= a2 <= a3 <= ... <= an?????????????
*/
int divide(int n,int a)//n?????????a????????????????????
{
int s=0,i;
if(n==1) return 1;//n?1???
for(i=a;i>1;i--)
if(n%i==0)
s+=divide(n/i,i);//???????
... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.