模拟
sxk_sxy
努力用自己辛勤的汗水,成为一名真正的ACMer
展开
-
POJ 1363 怎么又是水题
“水题”?真的好垃圾,真么水的题,竟然做了一两天。哎!我真是太菜了。。。。。。。要加油了!题目及代码如下原创 2014-01-20 12:39:18 · 1037 阅读 · 0 评论 -
URAL 1712. Cipher Grille (模拟)
1712. Cipher GrilleTime limit: 0.5 secondMemory limit: 64 MBOur program committee uses different tools for problem development: a mailing list, a version control system, an administration原创 2015-06-15 15:28:45 · 738 阅读 · 0 评论 -
HLJU 1222: 01串plus (模拟)
1222: 01串plusTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 35 Solved: 12[Submit][Status][Web Board]Description给定两个整数n和m,求是否存在恰好包含n个0和m个1的01串S,使得S中不存在子串"001"和"11"。如果存在符合条件的01串则输出字典序最小原创 2015-06-11 14:10:38 · 619 阅读 · 0 评论 -
URAL 1404. Easy to Hack! (模拟)
1404. Easy to Hack!Time limit: 1.0 secondMemory limit: 64 MBWhen Vito Maretti writes an important letter he encrypts it. His method is not very reliable but it’s enough to make any detecti原创 2015-06-23 11:24:44 · 674 阅读 · 0 评论 -
URAL 1881. Long problem statement
1881. Long problem statementTime limit: 0.5 secondMemory limit: 64 MBWhile Fedya was writing the statement of the problem GOV Chronicles, he realized that there might be not enough pap原创 2015-03-07 20:50:02 · 519 阅读 · 0 评论 -
URAL 1319. Hotel (模拟)
1319. HotelTime limit: 1.0 secondMemory limit: 64 MB— You programmers are lucky! You don't have to deal with these terrible people – designers… This story happened with me not so long原创 2015-03-06 23:14:25 · 591 阅读 · 0 评论 -
URAL 1581. Teamwork
1581. TeamworkTime limit: 1.0 secondMemory limit: 64 MBVasya and Petya are going to participate in a team olympiad in informatics. They have listened to the stories told by the gurus o原创 2015-03-07 11:57:37 · 810 阅读 · 0 评论 -
URAL 1313 Some Words about Sport (阅读理解)
1313 Some Words about SportTime limit: 0.5 secondMemory limit: 64 MBUral doctors worry about the health of their youth very much. Special investigations showed that a lot of clever stu原创 2015-03-06 19:20:34 · 1002 阅读 · 0 评论 -
URAL 1893. A380 (阅读理解 + 模拟)
1893. A380Time limit: 1.0 secondMemory limit: 64 MBThere was no limit to Jack's joy! He managed to buy on the Internet tickets to the ICPC semifinal contest, which was to be held very原创 2015-03-08 21:29:11 · 956 阅读 · 0 评论 -
URAL 1787 Turn for MEGA (贪心 + 模拟)
Turn for MEGATime limit: 1.0 secondMemory limit: 64 MBA traffic light at the turn for the “MEGA” shopping center from the Novomoskovskiy highway works in such a way that k cars are abl原创 2015-03-04 17:45:49 · 1030 阅读 · 0 评论 -
URAL 1197 Lonesome Knight (判断)
Lonesome KnightTime limit: 1.0 secondMemory limit: 64 MBThe statement of this problem is very simple: you are to determine how many squares of the chessboard can be attacked by a knigh原创 2015-03-04 23:34:04 · 820 阅读 · 0 评论 -
BestCoder Round #33
zhx's submissionsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 858 Accepted Submission(s): 233Problem DescriptionAs one o原创 2015-03-15 12:54:02 · 711 阅读 · 0 评论 -
CCF (HLJU 1180)点击窗口 (模拟)
1180: 点击窗口Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 10 Solved: 3[Submit][Status][Web Board]Description 在某图形操作系统中,有 N 个窗口,每个窗口都是一个两边与坐标轴分别平行的矩形区域。窗口的边界上的点也属于该窗口。窗口之间有层次的区原创 2015-01-11 10:34:31 · 3497 阅读 · 0 评论 -
2014东北农大校赛--A. Paint it! (预处理)
1141: A.Paint it!Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 13 Solved: 10[Submit][Status][Web Board]Description有一个n*m的棋盘,每个格子只可能是黑和白两种颜色,你可以使用染料将某个格子染成黑色或者白色。求最少需要染多少个格子,能使当前的原创 2014-11-21 19:52:50 · 1183 阅读 · 0 评论 -
VK Cup 2012 Qualification Round 1---C. Cd and pwd commands
Cd and pwd commandstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya is writing an operating system原创 2014-10-30 00:38:18 · 1067 阅读 · 0 评论 -
弱校联萌十一大决战之强力热身 J. Right turn (模拟)
J. Right turnTime Limit: 1000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: MainSubmit Statusfrog is trapped in a maze. The maze is infinitely large and divided into gri原创 2015-10-03 17:39:04 · 1136 阅读 · 0 评论