上一页 1 ··· 34 35 36 37 38 39 40 41 42 ··· 53 下一页
摘要: PotsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 12198Accepted: 5147Special JudgeDescriptionYou are given two pots, having the volume of A... 阅读全文
posted @ 2015-08-27 19:42 柳下_MBX 阅读(169) 评论(0) 推荐(0) 编辑
摘要: Curling 2.0Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 14563Accepted: 6080DescriptionOn Planet MM-21, after their Olympic games this year... 阅读全文
posted @ 2015-08-26 20:59 柳下_MBX 阅读(191) 评论(0) 推荐(0) 编辑
摘要: 循环小数 IITime Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 155(55 users)Total Accepted: 92(51 users)Rating: Special Judge: NoDescription对于一个小数,我们记作0... 阅读全文
posted @ 2015-08-26 18:56 柳下_MBX 阅读(353) 评论(0) 推荐(0) 编辑
摘要: Error CurvesTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1198Accepted Submission(s): 460Problem... 阅读全文
posted @ 2015-08-25 19:12 柳下_MBX 阅读(287) 评论(0) 推荐(0) 编辑
摘要: 求第n个数,该数满足至少由3个不同的素数的乘机组成#include#include#include#include#includeusing namespace std;int prim[5000];int ans[5000];int cnt1,cnt2;void getvis(){ cnt... 阅读全文
posted @ 2015-08-24 18:25 柳下_MBX 阅读(240) 评论(3) 推荐(0) 编辑
摘要: 题意:在一个n*m的网格上,从(0,0)走到(n-1,m-1),每次只能向右或者向下走一格。一个人最初有一个生命值x,走到每一个格生命值会 变为x + s[i][j],(s[i][j]可为负,0,正),若生命值小于等于0,则人死亡。告诉网格上所有s[i][j],求x的最小值使得该人能够或者走到 (n... 阅读全文
posted @ 2015-08-22 11:51 柳下_MBX 阅读(331) 评论(0) 推荐(0) 编辑
摘要: A: http://acm.hust.edu.cn/vjudge/contest/view.action?cid=83690#problem/A 题意:N*M的格子,从左上走到右下,要求在每个点的权值必须大于0,问起始的时候必须有多少能量 思路:二分答案#include#include#includ... 阅读全文
posted @ 2015-08-20 10:28 柳下_MBX 阅读(222) 评论(0) 推荐(0) 编辑
摘要: Find The MultipleTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 22121Accepted: 9081Special JudgeDescriptionGiven a positive integer n, write... 阅读全文
posted @ 2015-08-20 10:20 柳下_MBX 阅读(136) 评论(0) 推荐(0) 编辑
摘要: Prime PathTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 14276Accepted: 8045DescriptionThe ministers of the cabinet were quite upset by the ... 阅读全文
posted @ 2015-08-19 10:24 柳下_MBX 阅读(162) 评论(0) 推荐(0) 编辑
摘要: Dungeon MasterTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 21230Accepted: 8261DescriptionYou are trapped in a 3D dungeon and need to find ... 阅读全文
posted @ 2015-08-18 16:51 柳下_MBX 阅读(203) 评论(0) 推荐(0) 编辑
上一页 1 ··· 34 35 36 37 38 39 40 41 42 ··· 53 下一页