随笔分类 - water~
摘要：Server Time: Sat Aug 11, 2012 2:16 pm Server Time: Sat Aug 11, 2012 2:16 pm Home Volume Contest Training Community Credits Welcome LinweiGang ( logout
阅读全文
摘要：Server Time:Sat Aug 11, 2012 1:59 pmHomeVolumeContestTrainingCommunityCreditsWelcomeLinweiGang (logout)1020 - A Childhood GamePDF (English)StatisticsForumTime Limit:0.5 second(s)Memory Limit:32 MBAlice and Bob are playing a game with marbles; you may have played this game in childhood. The game is p
阅读全文
摘要：1354 - IP CheckingPDF (English)StatisticsForumTime Limit:2 second(s)Memory Limit:32 MBAn IP address is a 32 bit address formatted in the following waya.b.c.dwherea, b, c, dare integers each ranging from0 to 255. Now you are given two IP addresses, first one in decimal form and second one in binary f
阅读全文
摘要：1004 - Monkey Banana ProblemPDF (English)StatisticsForumTime Limit:2 second(s)Memory Limit:32 MBYou are in the world of mathematics to solve the great "Monkey Banana Problem". It states that, a monkey enters into a diamond shaped two dimensional array and can jump in any of the adjacent ce
阅读全文
摘要：Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13056Accepted Submission(s): 5420Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a goo
阅读全文
摘要：Train Problem ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11117Accepted Submission(s): 4042Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because
阅读全文
摘要：Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13700Accepted Submission(s): 6250Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of nu
阅读全文
摘要：大菲波数Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6572Accepted Submission(s): 2157Problem DescriptionFibonacci数列，定义如下：f(1)=f(2)=1f(n)=f(n-1)+f(n-2) n>=3。计算第n项Fibonacci数值。Input输入第一行为一个整数N，接下来N行为整数Pi（1<=Pi<=1000）。Output输出为N行，每行为对应的f(Pi)。Sa
阅读全文
摘要：前进Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2223Accepted Submission(s): 1788Problem Description轻松通过墓碑，进入古墓后，才发现里面别有洞天。突然，Yifenfei发现自己周围是黑压压的一群蝙蝠，个个扇动翅膀正准备一起向他发起进攻！形势十分危急！好在此时的yifenfei已经不是以前那个经常被lemon抢走MM的菜鸟了！面对众多蝙蝠的嗜血狂攻，只见yifenfei使出轻灵的剑法，刷，刷，
阅读全文
摘要：彼岸Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1887Accepted Submission(s): 1027Problem Description突破蝙蝠的包围，yifenfei来到一处悬崖面前，悬崖彼岸就是前进的方向，好在现在的yifenfei已经学过御剑术，可御剑轻松飞过悬崖。现在的问题是：悬崖中间飞着很多红，黄，蓝三种颜色的珠子，假设我们把悬崖看成一条长度为n的线段，线段上的每一单位长度空间都可能飞过红，黄，蓝三种珠子，而yife
阅读全文
摘要：前m大的数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5195Accepted Submission(s): 1856Problem Description还记得Gardon给小希布置的那个作业么？（上次比赛的1005）其实小希已经找回了原来的那张数表，现在她想确认一下她的答案是否正确，但是整个的答案是很庞大的表，小希只想让你把答案中最大的M个数告诉她就可以了。给定一个包含N(N<=3000)个正整数的序列，每个数不超过5000，对它
阅读全文
摘要：寻梦Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2390Accepted Submission(s): 1871Problem Description每个人的童年都可能梦想过自己成为一个英雄，尤其是喜欢武侠的男生，Yifenfei也不例外。童年的他常常梦想自己能成为一个绝世英雄，手拿一把灿灿发亮的宝剑，手挽一位长发飘逸的秀丽气质MM ^_^ ，散步于清幽的泉边小道，微风吹过，飘落两片枫叶。。。。。。正由于成天陶醉于这种脱世的意境之中，导致此
阅读全文
摘要：CoinTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 662Accepted Submission(s): 329Problem DescriptionMoon has many coins, but only contains two value types which is 5 cents and 7 cents, Some day he find that he can get any value which greater than
阅读全文
摘要：Problem Description随着物理学的发展，科学家们发现了越来越多的粒子。有一天，筱莜在做实验的时候发现了一种麻烦的粒子，因为这些粒子必须成对产生或消失。面对这些粒子，筱莜开始头痛，怎么放置这些粒子才能让他们都消失呢？经过很多天的努力，筱莜终于设计出了一个实验装置，它是一个的立方体，编号A,B,C,……H,如图所示，每个顶点上都有一定数量的“麻烦”子，不同顶点初始的“麻烦”子数量可能不同。每次可以选择两个相邻的顶点，让他们同时产生或者消失。例如：每个照相机里的初始粒子数为1，0，1，0，3，1，0，0，那么一个合法的操作顺序为：EF-,EA-,AD+,AE-,DC-(EF-表示点E
阅读全文
摘要：Big NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15735Accepted Submission(s): 6954Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data,
阅读全文
摘要：World Cup NoiseTime Limit:1000MSMemory Limit:30000KTotal Submissions:13155Accepted:6512DescriptionBackground"KO-RE-A, KO-RE-A" shout 54.000 happy football fans after their team has reached the semifinals of the FIFA World Cup in their home country. But although their excitement is real, th
阅读全文
摘要：GCD AgainTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1314Accepted Submission(s): 487Problem DescriptionDo you have spent some time to think and try to solve those unsolved problem after one ACM contest?No? Oh, you must do this when you want to
阅读全文
摘要：The sum problemTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9020Accepted Submission(s): 2759Problem DescriptionGiven a sequence 1,2,3,......N, your job is to calculate all the possible sub-sequences that the sum of the sub-sequence is M.InputInp
阅读全文
摘要：RelativesTime Limit:1000MSMemory Limit:65536KTotal Submissions:8841Accepted:4134DescriptionGiven n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime if there are no integers x > 1, y > 0, z > 0 such that a = xy a
阅读全文
摘要：Number StepsTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionStarting from point (0,0) on a plane, we have written all non-negative integers 0, 1, 2,... as shown in the figure. For example, 1, 2, and 3 has been written at points (1,1),
阅读全文
浙公网安备 33010602011771号