Ultra-QuickSort
Time Limit: 7000MS
Memory Limit: 65536K
Total Submissions: 46080
Accepted: 16763
Description
In this problem, you have to analyze a particular sorting...
分类:
编程语言 时间:
2015-04-21 22:49:23
阅读次数:
209
1463: Alphabet Cookies
Time Limit: 1 Sec Memory Limit: 128 MB
Submit: 72 Solved: 37
SubmitStatusWeb
Board
Description
Kitty likes cookies very much, and especially the alphabet cookies....
分类:
其他好文 时间:
2015-04-21 22:47:50
阅读次数:
202
Japan
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 22258
Accepted: 5995
Description
Japan plans to welcome the ACM ICPC World Finals and a lot of roads ...
分类:
编程语言 时间:
2015-04-21 22:46:39
阅读次数:
182
windy数
Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others)
windy定义了一种windy数。
不含前导零且相邻两个数字之差至少为2的正整数被称为windy数。
windy想知道,在A和B之间,包括A和B,总共有多少个windy数?...
Reward
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4638 Accepted Submission(s): 1416
Problem Description
Dandelion's uncle is a ...
分类:
编程语言 时间:
2015-04-21 22:41:03
阅读次数:
172
Legal or Not
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5152 Accepted Submission(s): 2360
Problem Description
ACM-DIY is a larg...
分类:
编程语言 时间:
2015-04-21 22:38:27
阅读次数:
183
SPF题目抽象,给出一个连通图的一些边,求关节点。以及每个关节点分出的连通分量的个数 邻接矩阵只要16ms,而邻接表却要32ms, 花费了大量的时间在加边上。// time 16ms 1 #include 2 #inclu...
分类:
编程语言 时间:
2015-04-21 22:29:58
阅读次数:
231
Harmonic Number (II)Time Limit: 3000MSMemory Limit: 32768KB64bit IO Format: %lld & %llu Submit Status DescriptionI was trying to solve problem '1234 -...
分类:
其他好文 时间:
2015-04-21 22:16:54
阅读次数:
160
public class Books { private String book_no; private String book_name; private String book_author; private String release_time; private...
分类:
编程语言 时间:
2015-04-21 22:09:07
阅读次数:
186
确定比赛名次
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14558 Accepted Submission(s): 5814
Problem Description
有N个比赛队(1
Input...
分类:
编程语言 时间:
2015-04-21 20:51:45
阅读次数:
157