- 博客(9)
- 资源 (9)
- 收藏
- 关注
RSS订阅原创 HDU 4944 FSF’s game 解题报告（递推）
FSF’s gameTime Limit: 9000/4500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 72 Accepted Submission(s): 30Problem DescriptionFSF has programmed a
2014-08-12 18:50:49
925
原创 CF 457C Elections 解题报告（线段树）
C. Electionstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are running for a governor in a small city
2014-08-11 20:34:15
1509
3
原创 HDU 4920 Matrix multiplication 解题报告（暴力）
Matrix multiplicationTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 862 Accepted Submission(s): 343Problem DescriptionGiven tw
2014-08-05 20:40:54
660
原创 HDU 4919 Exclusive or 解题报告（规律+大数）
Exclusive orTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 131 Accepted Submission(s): 49Problem DescriptionGiven n, find the
2014-08-05 20:35:40
1010
原创 HDU 4913 Least common multiple 解题报告（线段树）
Least common multipleTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 83 Accepted Submission(s): 25Problem Descriptionbobo has a
2014-08-05 20:30:47
1555
原创 HDU 4911 Inversion 解题报告（逆序数）
InversionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 261 Accepted Submission(s): 112Problem Descriptionbobo has a sequence
2014-08-05 20:24:38
664
原创 UVa 387 - A Puzzling Problem 解题报告（暴力）
A Puzzling Problem The goal of this problem is to write a program which will take from 1 to 5puzzle pieces such asthose shown below and arrange them, if possible, to form a square.An examp
2014-08-04 12:18:22
835
原创 CF 453B Little Pony and Harmony Chest 解题报告（状态压缩DP）
B. Little Pony and Harmony Chesttime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPrincess Twilight went to
2014-08-03 13:27:32
777
原创 HDU 4906 Our happy ending 解题报告（递推）
#include #include #include #include #include #include #include #include #include #include #include using namespace std;#define ff(i, n) for(int i=0;i<(n);i++)#define fff(i, n, m) for(int
2014-08-01 11:32:52
881
2013 ACM ICPC Southeast USA Regional Programming Contest
2014-03-16
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人