kyoma的博客

免费馅饼Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 42016    Accepted Submission(s): 14452Problem Description都说天上不会掉馅饼，但有一天gameb

1098: Yifan and War3Time Limit: 3 Sec  Memory Limit: 128 MBSubmit: 637  Solved: 23[Submit][Status][Web Board]DescriptionAs we all know, There is a hero called Priestess of the Mo

Dire WolfTime Limit: 5000/5000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 2092    Accepted Submission(s): 1206Problem DescriptionDire wolves, a

畅通工程续Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 48533    Accepted Submission(s): 18024Problem Description某省自从实行了很多年的畅通工程计划后

问题 A: Unhappy sion时间限制: 1 Sec  内存限制: 128 MB提交: 335  解决: 153[提交][状态][讨论版]题目描述After 2rd ccpc,UNCLE RAN give sion a task,sion have to set 10 questions for this contest.But as a acm fan,

CoinsTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 35350 Accepted: 12015DescriptionPeople in Silverland use coins.They have coins of value A1,A2,A3...

1017: 最小差时间限制: 1 Sec  内存限制: 128 MB提交: 38  解决: 11[提交][状态][讨论版]题目描述假设有n个正整数a1,a2,a3…an，希望将这些数分成两组，使得两组的和差值最小。输入第一行输入整数m(0接下来每个用例由两行组成，第一行是一个整数n（1输出输出最小的差的绝对值。样例输入

Common SubsequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 48699 Accepted: 20076DescriptionA subsequence of a given sequence is the given sequenc

原题 Free DIY Tour Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6308 Accepted Submission(s): 2038 Problem Description Weiwei

Almost Sorted ArrayTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 3305    Accepted Submission(s): 828Problem DescriptionWe ar

Max SumTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 217848    Accepted Submission(s): 51419Problem DescriptionGiven a sequenc

寒冰王座Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15094    Accepted Submission(s): 7772Problem Description不死族的巫妖王发工资拉,死亡骑士拿到一张

1013: 冒险游戏(risk_ganme)时间限制: 2 Sec 内存限制: 2048 MB提交: 58 解决: 22[提交][状态][讨论版]题目描述河海组织一场冒险游戏,该游戏将场地分为N*M的方格,每个方格内均有一个关卡,要闯过每个关卡,都需要消耗一定数量的体力游戏的起点为(1,1) 终点为(N,M),每通过一关,可以选择右方或下方的一个关卡,顺利通过终点则挑战成功

D - Matrices with XOR property SPOJ - VECTAR1Imagine A is a NxM matrix with two basic properties1) Each element in the matrix is distinct and lies in the range of 12) For any two cel