畅通工程
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 16075 Accepted Submission(s): 6677
Problem Description
省政府“畅通工程”的目标...
分类：
其他好文 时间：
2014-07-15 22:20:11
阅读次数：
225
畅通工程
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 29362 Accepted Submission(s): 15452
Problem Description
某省调查城镇交通状况，...
分类：
其他好文 时间：
2014-07-15 22:15:14
阅读次数：
233
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12689 Accepted Submission(s): 6223
Problem Description
Today is Igna...
分类：
其他好文 时间：
2014-07-15 13:04:03
阅读次数：
324
继续畅通工程
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 13284 Accepted Submission(s): 5721
Problem Description
省政府“畅通工程”的目标是使全省任何...
分类：
其他好文 时间：
2014-07-15 12:47:30
阅读次数：
226
Wormholes
Time Limit: 2000MS
Memory Limit: 65536K
Total Submissions: 29971
Accepted: 10844
Description
While exploring his many farms, Farmer John has discovered a ...
分类：
其他好文 时间：
2014-07-15 12:40:21
阅读次数：
341
Matrix
Time Limit: 3000MS
Memory Limit: 65536K
Total Submissions: 17766
Accepted: 6674
Description
Given an N*N matrix A, whose elements are either 0 or 1. A[i, j] ...
分类：
其他好文 时间：
2014-07-15 12:24:44
阅读次数：
319
传送门：
POJ：点击打开链接
HDU：点击打开链接
A Bug's Life
Time Limit: 10000MS
Memory Limit: 65536K
Total Submissions: 27624
Accepted: 8979
Description
Background
Prof...
分类：
其他好文 时间：
2014-07-15 10:46:59
阅读次数：
274
Mobile phones
Time Limit: 5000MS
Memory Limit: 65536K
Total Submissions: 14291
Accepted: 6644
Description
Suppose that the fourth generation mobile phone base stati...
分类：
其他好文 时间：
2014-07-15 10:43:45
阅读次数：
224
Tautology
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 9302
Accepted: 3549
Description
WFF 'N PROOF is a logic game played with dice. Each die has six...
分类：
其他好文 时间：
2014-07-14 18:45:09
阅读次数：
289
Parencodings
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 19352
Accepted: 11675
Description
Let S = s1 s2...s2n be a well-formed string of parentheses...
分类：
其他好文 时间：
2014-07-14 18:19:13
阅读次数：
271
