一个大叔

摘要： GCD XORGiven an integer N, nd how many pairs (A; B) are there such that: gcd(A; B) = A xor B where1  B  A  N.Here gcd(A; B) means the greatest com... 阅读全文

摘要： Conquer a New RegionTime Limit:5 Seconds Memory Limit:32768 KBThe wheel of the history rolling forward, our king conquered a new region in a distant c... 阅读全文

摘要： Time Limit:1000MSMemory Limit:10000KTotal Submissions:11433Accepted:4551DescriptionA number of schools are connected to a computer network. Agreements... 阅读全文

摘要： ---恢复内容开始--- DiningTime Limit:2000MSMemory Limit:65536KTotal Submissions:9587Accepted:4426DescriptionCows... 阅读全文

摘要： InstrusiveTime Limit: 3000/1500 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 596Accepted Submission(s): 190Problem ... 阅读全文

摘要： D. Increase Sequencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPeter has a sequence of integ... 阅读全文

摘要： DescriptionEdward is a rich man. He owns a large factory for health drink production. As a matter of course, there is a large warehouse in the factory... 阅读全文

摘要： DescriptionGiven the value of N, you will have to find the value of G. The meaning of G is given in the following codeG=0; for(i=1;i&ltN;i++) for(j... 阅读全文

摘要： Arranging Your TeamTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1218Accepted Submission(s): 360... 阅读全文

摘要： Problem DescriptionUnlike single maze, double maze requires a common sequence of commands to solve both mazes. See the figure below for a quick unders... 阅读全文