~欢迎你!第 AmazingCounters.com 位造访者
上一页 1 ··· 4 5 6 7 8 9 10 11 下一页
摘要: 199. Beautiful People 199. Beautiful People time limit per test: 0.25 sec. memory limit per test: 65536 KB input: standard output: standard The most p 阅读全文
posted @ 2016-07-29 21:09 ~HDMaxfun 阅读(407) 评论(0) 推荐(0) 编辑
摘要: Roads in the North Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Roads in the North Description Building and maintaining roads am 阅读全文
posted @ 2016-07-29 20:29 ~HDMaxfun 阅读(637) 评论(0) 推荐(0) 编辑
摘要: Inversion Sequence Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%lld & %llu Inversion Sequence Description For sequence i1, i2, i3, … , iN, 阅读全文
posted @ 2016-07-28 00:18 ~HDMaxfun 阅读(311) 评论(0) 推荐(0) 编辑
摘要: Problem C Time Limit:1000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64u Problem C Description 度熊手上有一本神奇的字典,你可以在它里面做如下三个操作: 1、insert : 往神奇字典中插入 阅读全文
posted @ 2016-07-27 23:56 ~HDMaxfun 阅读(153) 评论(0) 推荐(1) 编辑
摘要: 海贼王之伟大航路 Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u 海贼王之伟大航路 Description “我是要成为海贼王的男人!”,路飞一边喊着这样的口号,一边和他的伙伴们一起踏上了伟大航路的艰险历程。 阅读全文
posted @ 2016-07-27 23:37 ~HDMaxfun 阅读(881) 评论(0) 推荐(0) 编辑
摘要: Runtime Error Bahosain was trying to solve this simple problem, but he got a Runtime Error on one of the test cases, can you help him by solving it? G 阅读全文
posted @ 2016-07-27 00:26 ~HDMaxfun 阅读(580) 评论(0) 推荐(0) 编辑
摘要: Heavy Coins Bahosain has a lot of coins in his pocket. These coins are really heavy, so he always tries to get rid of some of the coins by using them 阅读全文
posted @ 2016-07-27 00:22 ~HDMaxfun 阅读(667) 评论(0) 推荐(0) 编辑
摘要: Travelling Salesman After leaving Yemen, Bahosain now works as a salesman in Jordan. He spends most of his time travelling between different cities. H 阅读全文
posted @ 2016-07-27 00:01 ~HDMaxfun 阅读(363) 评论(0) 推荐(0) 编辑
摘要: Epic Professor Dr. Bahosain works as a professor of Computer Science at HU (Hadramout University). After grading his programming exam, he noticed that 阅读全文
posted @ 2016-07-26 23:43 ~HDMaxfun 阅读(272) 评论(0) 推荐(0) 编辑
摘要: Bahosain is walking in a street of N blocks. Each block is either empty or has one lamp. If there is a lamp in a block, it will light it’s block and t 阅读全文
posted @ 2016-07-26 23:28 ~HDMaxfun 阅读(296) 评论(0) 推荐(0) 编辑
上一页 1 ··· 4 5 6 7 8 9 10 11 下一页