上一页 1 ··· 5 6 7 8 9 10 11 12 13 ··· 19 下一页
摘要: Problem DescriptionMatrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. Ho... 阅读全文
posted @ 2013-06-16 17:32 forevermemory 阅读(255) 评论(0) 推荐(0) 编辑
摘要: Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐 (都是没有刻度的,且 S==N+M,101>S>0,N>0,M>0) 。聪明的ACMER你们说他们能平分吗?如果能请输出倒可乐的最少的次数,如果不能输出"NO"。Input三个整数 : S 阅读全文
posted @ 2013-06-16 10:44 forevermemory 阅读(177) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionDo you remember a sentence "Accepted today?" Yes, the sentence is mentioned frequently in lcy's course "ACM Programming"! The contest is still in progress this moment. How excited it is! You, smart programmer, must have AC some problems today. "Can I g 阅读全文
posted @ 2013-06-14 23:38 forevermemory 阅读(275) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionMax is the king of the universe, he rules billions of planets. In each planet, there may be several residents. Residents of Max's kingdom will never die, so some of them may be as old as the universe (It is a magic world, isn't it?). One day, Max wants to know how intelleg 阅读全文
posted @ 2013-06-06 01:28 forevermemory 阅读(363) 评论(0) 推荐(0) 编辑
摘要: 描述外星人指的是地球以外的智慧生命。外星人长的是不是与地球上的人一样并不重要,但起码应该符合我们目前对生命基本形式的认识。比如,我们所知的任何生命都离不开液态水,并且都是基于化学元素碳(C)的有机分子组合成的复杂有机体。42岁的天文学家Dr. Kong已经执著地观测ZDM-777星球十多年了,这个被称为“战神”的红色星球让他如此着迷。在过去的十多年中,他经常有一些令人激动的发现。ZDM-777星球表面有着明显的明暗变化,对这些明暗区域,Dr. Kong已经细致地研究了很多年,并且绘制出了较为详尽的地图。他坚信那些暗区是陆地,而亮区则是湖泊和海洋。他一直坚信有水的地方,一定有生命的痕迹。Dr. 阅读全文
posted @ 2013-06-04 12:22 forevermemory 阅读(838) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionWe have learned how to obtain the value of a polynomial when we were a middle school student. If f(x) is a polynomial of degree n, we can let If we have x, we can get f(x) easily. But a computer can not understand the expression like above. So we had better make a program to obta. 阅读全文
posted @ 2013-06-03 18:01 forevermemory 阅读(257) 评论(0) 推荐(0) 编辑
摘要: 数字游戏Time Limit : 3000/1000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 178 Accepted Submission(s) : 58Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem Description小艾和小牛在上数学课的时候觉得非常的无聊,于是他们想出了一个新的游戏,小牛写下N位的数字,小艾的任务就是在去除了K位后得到一个最大的数。Input输入有多组数据。第一行输入一个N和. 阅读全文
posted @ 2013-06-03 00:58 forevermemory 阅读(257) 评论(0) 推荐(0) 编辑
摘要: DescriptionMany people like to solve hard puzzles some of which may lead them to madness. One such puzzle could be finding a hidden prime number in a given text. Such number could be the number of different substrings of a given size that exist in the text. As you soon will discover, you really need 阅读全文
posted @ 2013-06-02 21:38 forevermemory 阅读(401) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionPirates have finished developing the typing software. He called Cathy to test his typing software. She is good at thinking. After testing for several days, she finds that if she types a string by some ways, she will type the key at least. But she has a bad habit that if the caps l 阅读全文
posted @ 2013-05-28 17:56 forevermemory 阅读(347) 评论(0) 推荐(0) 编辑
摘要: Problem Description A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the first 20 humble numbers. Write a program to find and print the nth element in this sequence Input The inp. 阅读全文
posted @ 2013-05-28 11:18 forevermemory 阅读(142) 评论(0) 推荐(0) 编辑
上一页 1 ··· 5 6 7 8 9 10 11 12 13 ··· 19 下一页