摘要: 154. Factorialtime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standard inputoutput: standard outputYou task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1*2*...*N. For example, 5! = 120, 120 contains on 阅读全文
posted @ 2013-08-23 22:32 码代码的猿猿 阅读(260) 评论(0) 推荐(0) 编辑
摘要: Broken NecklaceYou have a necklace of N red, white, or blue beads (3 7 #include 8 #include 9 #include 10 #include 11 12 using namespace std;13 const int INF=0x3f3f3f3f;14 15 int main()16 {17 freopen("beads.in","r",stdin);18 freopen("beads.out","w",stdout);19 2 阅读全文
posted @ 2013-08-23 09:55 码代码的猿猿 阅读(243) 评论(0) 推荐(0) 编辑
摘要: Friday the ThirteenthIs Friday the 13th really an unusual event?That is, does the 13th of the month land on a Friday less often than on any other day of the week? To answer this question, write a program that will compute the frequency that the 13th of each month lands on Sunday, Monday, Tuesday, We 阅读全文
posted @ 2013-08-23 09:54 码代码的猿猿 阅读(260) 评论(0) 推荐(0) 编辑
摘要: Greedy Gift GiversA group of NP (2 ≤ NP ≤ 10) uniquely named friends has decided to exchange gifts of money. Each of these friends might or might not give some money to any or all of the other friends. Likewise, each friend might or might not receive money from any or all of the other friends. Your 阅读全文
posted @ 2013-08-23 09:53 码代码的猿猿 阅读(237) 评论(0) 推荐(0) 编辑
摘要: Your Ride Is HereIt is a well-known fact that behind every good comet is a UFO. These UFOs often come to collect loyal supporters from here on Earth. Unfortunately, they only have room to pick up one group of followers on each trip. They do, however, let the groups know ahead of time which will be p 阅读全文
posted @ 2013-08-23 09:52 码代码的猿猿 阅读(371) 评论(0) 推荐(0) 编辑
摘要: 用力过猛,撇坏了两个卡子很容易就装上去了目前的配置升级到3G内存,飞一般的感觉!!!爽http://speccy.piriform.com/results/P0uJJVgaWl0DY2fnm3AOlcJ 阅读全文
posted @ 2013-08-23 03:38 码代码的猿猿 阅读(143) 评论(0) 推荐(0) 编辑