随笔分类 - STL
摘要:寻找大富翁Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4504Accepted Submission(s): 1838Problem Descr...
阅读全文
摘要:The kth great numberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 8246Accepted Submission(s): 32...
阅读全文
摘要:Windows Message QueueTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4352Accepted Submission(s): 1...
阅读全文
摘要:懒省事的小明时间限制:3000ms | 内存限制:65535KB难度:3描述 小明很想吃果子,正好果园果子熟了。在果园里,小明已经将所有的果子打了下来,而且按果子的不同种类分成了不同的堆。小明决定把所有的果子合成一堆。 因为小明比较懒,为了省力气,小明开始想点子了: 每一次合并,小明可以把两堆果子...
阅读全文
摘要:StonesTime Limit: 5000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1363Accepted Submission(s): 850Problem Descr...
阅读全文
摘要:Nightmare时间限制:1000ms | 内存限制:65535KB难度:4描述Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth h...
阅读全文
摘要:3D dungeon时间限制:1000ms | 内存限制:65535KB难度:2描述You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes...
阅读全文
摘要:迷宫问题Time Limit:1000MSMemory Limit:65536KTotal Submissions:10103Accepted:6005Description定义一个二维数组:int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0,...
阅读全文
摘要:Dungeon MasterTime Limit:1000MSMemory Limit:65536KTotal Submissions:19222Accepted:7466DescriptionYou are trapped in a 3D dungeon and need to find the ...
阅读全文
摘要:胜利大逃亡Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28023 Accepted Submission(s): 10632Problem D...
阅读全文
摘要:Find a wayTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5401Accepted Submission(s): 1823Problem ...
阅读全文
摘要:RescueTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19985Accepted Submission(s): 7110Problem Des...
阅读全文
摘要:最少步数时间限制:3000ms | 内存限制:65535KB难度:4描述这有一个迷宫,有0~8行和0~8列:1,1,1,1,1,1,1,1,11,0,0,1,0,0,1,0,11,0,0,1,1,0,0,0,11,0,1,0,1,1,0,1,11,0,0,0,0,1,0,0,11,1,0,1,0,1...
阅读全文
摘要:Train Problem ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24980Accepted Submission(s): 9424Pr...
阅读全文
摘要:ACboy needs your help again!Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4241Accepted Submissio...
阅读全文
摘要:栈遵循先进后出的原则 括号配对问题时间限制:3000ms | 内存限制:65535KB难度:3描述现在,有一行括号序列,请你检查这行括号是否配对。输入第一行输入一个数N(0#include#define MAX 101000char zhan[MAX],str[MAX...
阅读全文