- 博客(8)
- 收藏
- 关注
RSS订阅原创 HDoj-1010-Tempter of the Bone-DFS
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 74250 Accepted Submission(s): 20326Problem DescriptionThe dogg
2014-11-30 10:44:25
706
原创 2014ACM/ICPC亚洲区北京站-A Curious Matt
A Curious MattTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem Description There is a curious man
2014-11-29 13:35:30
1066
原创 prev_permutation 函数
这是一个求一个排序的下一个排列的函数，可以遍历全排列,要包含头文件下面是以前的笔记 与之完全相反的函数还有prev_permutation (1) int 类型的next_permutation int main(){ int a[3];a[0]=1;a[1]=2;a[2]=3; do{cout} while (next_permutat
2014-11-19 19:42:17
1988
原创 POJ-1328 Radar Installation-贪心算法
DescriptionAssume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, l
2014-11-15 14:41:23
833
原创 HDoj-1312-Red and Black -BFS
Red and BlackTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10064 Accepted Submission(s): 6276Problem DescriptionThere is a rect
2014-11-15 14:38:45
733
原创 HDOJ-1060-Leftmost Digit（求n^n的最高位）
【科普】什么是BestCoder？如何参加？Leftmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13554 Accepted Submission(s): 5211P
2014-11-15 14:30:13
725
原创 HDoj- 2054 A==B？
【科普】什么是BestCoder？如何参加？A == B ?Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 64601 Accepted Submission(s): 10105Proble
2014-11-15 14:27:53
1048
原创 HDoj-1257-最少拦截系统
最少拦截系统Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19520 Accepted Submission(s): 7761Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦
2014-11-07 21:06:39
741
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人