摘要：
Bone CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21463Accepted Submission(s): 8633Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such 阅读全文
posted @ 2013-08-04 20:17
龚细军
阅读(294)
评论(0)
推荐(0)
摘要：
HangOverTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7884Accepted Submission(s): 3233Problem DescriptionHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We 阅读全文
posted @ 2013-08-04 16:26
龚细军
阅读(208)
评论(0)
推荐(0)
摘要：
1stingTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2372Accepted Submission(s): 947Problem DescriptionYou will be given a string which only contains ‘1’; You can merge two adjacent ‘1’ to be ‘2’, or leave the ‘1’ there. Surly, you may get many di 阅读全文
posted @ 2013-08-04 15:51
龚细军
阅读(540)
评论(0)
推荐(0)
摘要：
大菲波数Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8496Accepted Submission(s): 2863Problem DescriptionFibonacci数列，定义如下：f(1)=f(2)=1f(n)=f(n-1)+f(n-2) n>=3。计算第n项Fibonacci数值。Input输入第一行为一个整数N，接下来N行为整数Pi（1 2 #define maxn 210 3 #define len 1001 4 usi 阅读全文
posted @ 2013-08-04 15:29
龚细军
阅读(240)
评论(0)
推荐(0)
摘要：
Children’s QueueTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8835Accepted Submission(s): 2813Problem DescriptionThere are many students in PHT School. One day, the headmaster whose name is PigHeader wanted all students stand in a line. He prescr 阅读全文
posted @ 2013-08-04 15:05
龚细军
阅读(260)
评论(0)
推荐(0)
摘要：
Hat's FibonacciTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5800Accepted Submission(s): 1926Problem DescriptionA Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.F(1) = 阅读全文
posted @ 2013-08-04 12:16
龚细军
阅读(421)
评论(0)
推荐(0)
摘要：
Buy the TicketTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3614Accepted Submission(s): 1522Problem DescriptionThe "Harry Potter and the Goblet of Fire" will be on show in the next few days. As a crazy fan of Harry Potter, you will go t 阅读全文
posted @ 2013-08-04 10:35
龚细军
阅读(888)
评论(0)
推荐(1)
摘要：
对于排队买票问题的一些说法..... 假若有M+ N人去买票，n人手持5元，m人手持10元，而售货阿姨没有零钱，问有多少种方法能使大家都买到票。其中mn时的情况啦！但是即便去考虑的话，这种情况依旧为零.因为m>n时，你不管这么排列都是不可能找开的...m*10-n*5>m*5----所以这个条件只是为我们减少了一小部分的时间. (2)mn)最后加上分配排列就是(C(m+n,m)-C(m+n,n+1))*m!*n!化解之后为： （m+1-n）*(m+n)!/(m+1); 阅读全文
posted @ 2013-08-04 09:54
龚细军
阅读(435)
评论(0)
推荐(0)
摘要：
选课时间(题目已修改,注意读题)Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2254Accepted Submission(s): 1791Problem Description又到了选课的时间了，xhd看着选课表发呆，为了想让下一学期好过点，他想知道学n个学分共有多少组合。你来帮帮他吧。（xhd认为一样学分的课没区别）Input输入数据的第一行是一个数据T，表示有T组数据。每组数据的第一行是两个整数n(1 2 #include 3 us. 阅读全文
posted @ 2013-08-04 08:25
龚细军
阅读(682)
评论(0)
推荐(0)
浙公网安备 33010602011771号