摘要:AnswersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 25Accepted Submission(s): 16Problem DescriptionSample Input2 42 22 10 1 2 3Sample OutputNOYESYESYESSource2013 Multi-University Training Contest 10Recommendzhuyuanchen520分容易发现规律。如果M 8 #include
阅读全文
摘要:GCDTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4291Accepted Submission(s): 1502Problem DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common divisor of x an
阅读全文
摘要:Front compressionTime Limit: 5000/5000 MS (Java/Others)Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 158Accepted Submission(s): 63Problem DescriptionFront compression is a type of delta encoding compression algorithm whereby common prefixes and their lengths are recorded so that th
阅读全文
摘要:EBCDICTime Limit: 2000/2000 MS (Java/Others)Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 160Accepted Submission(s): 81Problem DescriptionA mad scientist found an ancient message from an obsolete IBN System/360 mainframe. He believes that this message contains some very important s
阅读全文
摘要:Arc of DreamTime Limit: 2000/2000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 0Accepted Submission(s): 0Problem DescriptionAn Arc of Dream is a curve defined by following function:wherea0 = A0ai = ai-1*AX+AYb0 = B0bi = bi-1*BX+BYWhat is the value of AoD(N) modulo 1,
阅读全文
摘要:GCDTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4272Accepted Submission(s): 1492Problem DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common divisor of x an
阅读全文
摘要:题目链接:http://www.lydsy.com/JudgeOnline/problem.php?id=2038专题练习:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29469#overview2038: [2009国家集训队]小Z的袜子(hose)Time Limit:20 SecMemory Limit:259 MBSubmit:966Solved:472[Submit][Status]Description作为一个生活散漫的人,小Z每天早上都要耗费很久从一堆五颜六色的袜子中找出一双来穿。终于有一天,小Z再也无法忍受这恼人的
阅读全文
摘要:Prince and PrincessTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 150Accepted Submission(s): 46Problem DescriptionThere are n princes and m princesses. Princess can marry any prince. But prince can only marry the princess they DO love.For all prin
阅读全文
摘要:MineTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 51Accepted Submission(s): 6Problem DescriptionHave you ever played a game in Windows: Mine?This game is played on a n*m board, just like the Pic(1)On the board, Under some grids there are mines (r
阅读全文
摘要:Terrorist’s destroyTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 24Accepted Submission(s): 6Problem DescriptionThere is a city which is built like a tree.A terrorist wants to destroy the city's roads. But now he is alone, he can only destroy
阅读全文
摘要:StringTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 11Accepted Submission(s): 4Problem DescriptionGiven 3 strings A, B, C, find the longest string D which satisfy the following rules:a) D is the subsequence of Ab) D is the subsequence of Bc) C is
阅读全文
摘要:Aragorn's StoryTime Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1321Accepted Submission(s): 344Problem DescriptionOur protagonist is the handsome human prince Aragorn comes from The Lord of the Rings. One day Aragorn finds a lot of enemies who
阅读全文
摘要:GCD of SequenceTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 46Accepted Submission(s): 14Problem DescriptionAlice is playing a game with Bob.Alice shows N integers a1, a2, …, aN, and M, K. She says each integers 1 ≤ ai≤ M.And now Alice wants to a
阅读全文
摘要:Backup PlanTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 93Accepted Submission(s): 36Special JudgeProblem DescriptionMakomuno has N servers and M databases. All databases are synchronized among all servers and each database has a ordered list den
阅读全文
摘要:Mutiples on a circleTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 171Accepted Submission(s): 28Problem DescriptionTom has a necklace with n jewels. There is a number on each jewel. Now Tom wants to select a wonderful chain from the necklace. A ch
阅读全文
摘要:Building FenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 171Accepted Submission(s): 25Special JudgeProblem DescriptionLong long ago, there is a famous farmer named John. He owns a big farm and many cows. There are two kinds of cows on his farm
阅读全文
摘要:HyperspaceTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 67Accepted Submission(s): 32Problem DescriptionThe great Mr.Smith has invented a hyperspace particle generator. The device is very powerful. The device can generate a hyperspace. In the hy
阅读全文
摘要:Random WalkTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 65535/65536 K (Java/Others)Total Submission(s): 81Accepted Submission(s): 35Problem DescriptionYuanfang is walking on a chain. The chain has n nodes numbered from 1 to n. Every second, he can move from node i to node j with probability:c
阅读全文
摘要:X-BoxesTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 202Accepted Submission(s): 71Problem DescriptionCrazygirl is a crazy fan of XBOX games. Today, she’s here middle in a competition, in which the winner will be rewarded with an opportunity of wo
阅读全文
摘要:ShaolinTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 64Accepted Submission(s): 38Problem DescriptionShaolin temple is very famous for its Kongfu monks.A lot of young men go to Shaolin temple every year, trying to be a monk there. The master of Sh
阅读全文