Heavy Transportation
Time Limit: 3000MS
Memory Limit: 30000K
Total Submissions: 5123
Accepted: 1393
Description
Background Hugo Heavy is happy. After the breakdown of ……继续阅读 »
第四度
10年前 (2010-09-01) 196浏览 0评论
0个赞
Blocks
Time Limit: 1000MS
–
Memory Limit: 65536K
Total Submissions: 720
Accepted: 201
Description
Panda has received an assignment of painting a line of blocks. Si……继续阅读 »
第四度
10年前 (2010-08-31) 212浏览 0评论
0个赞
Euclid\’s Game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4525 Accepted: 1849 Description
Two players, Stan and Ollie, play, starting with two natural number……继续阅读 »
第四度
10年前 (2010-08-29) 218浏览 0评论
0个赞
Rank List
Time Limit: 10000MS
Memory Limit: 65536K
Total Submissions: 6561
Accepted: 2091
Description
Li Ming is a good student. He always asks the teacher about his r……继续阅读 »
第四度
10年前 (2010-08-28) 311浏览 0评论
0个赞
Binary Stirling Numbers
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 1040
Accepted: 346
Description
The Stirling number of the second kind S(n, m) stands ……继续阅读 »
第四度
10年前 (2010-08-28) 189浏览 0评论
0个赞
Matrix Multiplication
Time Limit: 2000MS
Memory Limit: 65536K
Total Submissions: 11924
Accepted: 2408
Description
You are given three n × n matrices A, B and C. Does t……继续阅读 »
第四度
10年前 (2010-08-27) 271浏览 0评论
0个赞
Mobile phones
Time Limit: 5000MS
Memory Limit: 65536K
Total Submissions: 7087
Accepted: 3030
Description
Suppose that the fourth generation mobile phone base stations ……继续阅读 »
第四度
10年前 (2010-08-27) 179浏览 0评论
0个赞
Cipher Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 12776 Accepted: 3194
Description Bob and Alice started to use a brand-new encoding scheme. Surprisingly it is not……继续阅读 »
第四度
10年前 (2010-08-25) 199浏览 0评论
0个赞
题意简单,就是找四个数的和为零.先把前两列的和算出来,O(n^2),存到hash表中,再把后两列的两两和算出来,在hash表中找相反数.用线性探测法就可以解决该问题了.
/*Source CodeProblem: 2785 User: y09shendazhi
Memory: 160132K Time: 2610MS
Langu……继续阅读 »
第四度
10年前 (2010-08-23) 176浏览 0评论
0个赞
读半天不解其意,傻算了半天才把sample凑出来.其实很
简单,连高精度都没有.第一类斯特灵数S(n,m)就是把n元集合分成m部的个数,有递推关系S(n,m)=S(n-1,m-1)+mS(n-1,m).所求还要全排列一下.再乘以m!就可以了累加1~B个数全部用上,就是结果.F(B)=sum(C(B,i)(Sum(Stir( i,j ) j ! ) ) )就……继续阅读 »
第四度
10年前 (2010-08-21) 169浏览 0评论
0个赞
