模拟
关注
分享
扫一扫
文章平均质量分 83
2997ms
这个作者很懒，什么都没留下…
展开
-
POJ 2014：Flow Layout 模拟水题
Flow LayoutTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3091 Accepted: 2148DescriptionA flow layout manager takes rectangular objects and places th原创 2015-08-11 10:20:43 · 568 阅读 · 0 评论 -
HDU 5565：Clarke and baton
Clarke and baton Accepts: 14 Submissions: 79 Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)问题描述克拉克是一名人格分裂患者。某一天，克拉克fork出了nn个自己，序号从11到n原创 2015-11-20 16:34:03 · 512 阅读 · 0 评论 -
POJ 3393：Lucky and Good Months by Gregorian Calendar 年+星期 模拟
Lucky and Good Months by Gregorian CalendarTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1619 Accepted: 539DescriptionHave you ever wondered why nor原创 2015-10-14 21:51:45 · 454 阅读 · 0 评论 -
51nod 1293：球与切换器
1293 球与切换器题目来源： Codility基准时间限制：1 秒 空间限制：131072 KB 分值: 80 难度：5级算法题 收藏 取消关注有N行M列的正方形盒子。每个盒子有三种状态0, -1, +1。球从盒子上边或左边进入盒子，从下边或右边离开盒子。规则：如果盒子的模式是-1，则进入它的球从下面出去。（方向变为向下）原创 2015-10-13 10:01:22 · 572 阅读 · 0 评论 -
POJ 1027：The Same Game 较(chao)为(ji)复(ma)杂(fan)的模拟
The Same GameTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5168 Accepted: 1944DescriptionThe game named "Same" is a single person game played on a 1原创 2015-10-25 13:10:08 · 1134 阅读 · 1 评论 -
POJ 3007：Organize Your Train part II
Organize Your Train part IITime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7561 Accepted: 2194DescriptionRJ Freight, a Japanese railroad company for f原创 2015-10-08 20:12:19 · 901 阅读 · 0 评论 -
HDU 5504：GT and sequence
GT and sequence Accepts: 95 Submissions: 1467 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述给出NN个整数。你要选择至少一个数，使得你选的数的乘积最大。保证任意选一些数原创 2015-10-18 16:47:48 · 544 阅读 · 0 评论 -
POJ 3371：Flesch Reading Ease 模拟
Flesch Reading EaseTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2071 Accepted: 606DescriptionFlesch Reading Ease, a readability test named after it原创 2015-10-20 21:39:09 · 547 阅读 · 0 评论 -
POJ 1472：Instant Complexity 模拟时间复杂度
Instant ComplexityTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1908 Accepted: 658DescriptionAnalyzing the run-time complexity of algorithms is an i原创 2015-10-16 15:20:26 · 656 阅读 · 0 评论 -
POJ 2993：Emag eht htiw Em Pleh
Emag eht htiw Em PlehTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionThis problem is a reverse case of the prob原创 2015-07-24 10:37:06 · 490 阅读 · 0 评论 -
POJ 1068：Parencodings
ParencodingsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22849 Accepted: 13394DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses原创 2015-07-22 14:43:31 · 473 阅读 · 0 评论 -
POJ 1573：Robot Motion
Robot MotionTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11324 Accepted: 5512DescriptionA robot has been programmed to follow the instructions原创 2015-07-22 22:01:10 · 391 阅读 · 0 评论 -
POJ 2996：Help Me with the Game
Help Me with the GameTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionYour task is to read a picture of a chessb原创 2015-07-24 10:34:16 · 499 阅读 · 0 评论 -
POJ 2632：Crashing Robots
Crashing RobotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8424 Accepted: 3648DescriptionIn a modernized warehouse, robots are used to fetch the g原创 2015-07-22 16:04:49 · 738 阅读 · 0 评论 -
HDU 5523：Game
Game Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)问题描述XY在玩一个游戏：有N根柱子排成一排，编号为1到N,每个柱子上面有一块宝石，现在XY站在第S根柱子上，出口在第T跟柱子上，XY需要拿到所有宝石后从出口离开。每次XY可以走到相邻的柱原创 2015-11-01 15:24:04 · 320 阅读 · 0 评论