上一页 1 2 3 4 5 6 7 8 9 ··· 16 下一页
摘要: 题目1 : Saving Tang Monk II 题目1 : Saving Tang Monk II 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 《Journey to the West》(also 《Monkey》) is one of the Four Grea 阅读全文
posted @ 2018-09-22 19:05 yzm10 阅读(603) 评论(0) 推荐(0) 编辑
摘要: Campus Design Campus Design Nanjing University of Science and Technology is celebrating its 60th anniversary. In order to make room for student activi 阅读全文
posted @ 2018-09-21 17:21 yzm10 阅读(226) 评论(0) 推荐(0) 编辑
摘要: Aeroplane chess Aeroplane chess Hzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For e 阅读全文
posted @ 2018-09-19 22:31 yzm10 阅读(152) 评论(0) 推荐(0) 编辑
摘要: Walk I used to think I could be anything, but now I know that I couldn't do anything. So I started traveling. The nation looks like a connected bidire 阅读全文
posted @ 2018-09-17 22:19 yzm10 阅读(185) 评论(0) 推荐(0) 编辑
摘要: Participate in E-sports 11.44% 1000ms 65536K Jessie and Justin want to participate in e-sports. E-sports contain many games, but they don't know which 阅读全文
posted @ 2018-09-15 18:09 yzm10 阅读(756) 评论(0) 推荐(0) 编辑
摘要: Mathematical Curse 22.25% 1000ms 65536K A prince of the Science Continent was imprisoned in a castle because of his contempt for mathematics when he w 阅读全文
posted @ 2018-09-15 18:07 yzm10 阅读(486) 评论(0) 推荐(0) 编辑
摘要: Transport Ship 25.78% 1000ms 65536K There are NN different kinds of transport ships on the port. The i^{th}ith kind of ship can carry the weight of V[ 阅读全文
posted @ 2018-09-15 18:04 yzm10 阅读(347) 评论(0) 推荐(0) 编辑
摘要: UVA - 13022 Sheldon Numbers 二进制形式满足ABA,ABAB数的个数(A为一定长度的1,B为一定长度的0)。 其实就是寻找在二进制中满足所有的1串具有相同的长度,所有的0串也具有相同的长度,并且在给定范围内的个数。 位运算。通过分析不难发现,所有解不会很大,因此我们可以暴力 阅读全文
posted @ 2018-09-14 16:01 yzm10 阅读(173) 评论(0) 推荐(0) 编辑
摘要: BE, GE or NE 23.58% 1000ms 262144K In a world where ordinary people cannot reach, a boy named "Koutarou" and a girl named "Sena" are playing a video g 阅读全文
posted @ 2018-09-12 17:04 yzm10 阅读(307) 评论(0) 推荐(0) 编辑
摘要: Mondriaan's Dream Mondriaan's Dream Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings 阅读全文
posted @ 2018-09-11 21:07 yzm10 阅读(166) 评论(0) 推荐(0) 编辑
摘要: Travelling After coding so many days,Mr Acmer wants to have a good rest.So travelling is the best choice!He has decided to visit n cities(he insists o 阅读全文
posted @ 2018-09-11 17:00 yzm10 阅读(168) 评论(0) 推荐(0) 编辑
摘要: Features Track 31.32% 1000ms 262144K Morgana is learning computer vision, and he likes cats, too. One day he wants to find the cat movement from a cat 阅读全文
posted @ 2018-09-09 17:13 yzm10 阅读(483) 评论(0) 推荐(0) 编辑
摘要: Hard to prepare 28.63% 1000ms 262144K After Incident, a feast is usually held in Hakurei Shrine. This time Reimu asked Kokoro to deliver a Nogaku show 阅读全文
posted @ 2018-09-09 17:11 yzm10 阅读(243) 评论(0) 推荐(0) 编辑
摘要: Travel PP loves travel. Her dream is to travel around country A which consists of N cities and M roads connecting them. PP has measured the money each 阅读全文
posted @ 2018-09-08 20:30 yzm10 阅读(189) 评论(0) 推荐(0) 编辑
摘要: Lattice's basics in digital electronics 44.08% 1000ms 131072K LATTICE is learning Digital Electronic Technology. He is talented, so he understood all 阅读全文
posted @ 2018-09-08 19:57 yzm10 阅读(253) 评论(0) 推荐(0) 编辑
摘要: 233 Matrix In our daily life we often use 233 to express our feelings. Actually, we may say 2333, 23333, or 233333 ... in the same meaning. And here i 阅读全文
posted @ 2018-09-06 22:12 yzm10 阅读(291) 评论(0) 推荐(0) 编辑
摘要: transaction transaction transaction Kelukin is a businessman. Every day, he travels around cities to do some business. On August 17th, in memory of a 阅读全文
posted @ 2018-09-04 22:51 yzm10 阅读(158) 评论(0) 推荐(0) 编辑
摘要: JLUCPC Dr. Skywind and Dr. Walkoncloud are planning to hold the annual JLU Collegiate Programming Contest. The contest was always held in the college 阅读全文
posted @ 2018-09-03 17:33 yzm10 阅读(203) 评论(0) 推荐(0) 编辑
摘要: AC Challenge 30.04% 1000ms 128536K Dlsj is competing in a contest with n (0 < n \le 20)n(0<n≤20) problems. And he knows the answer of all of these pro 阅读全文
posted @ 2018-09-01 18:32 yzm10 阅读(796) 评论(0) 推荐(0) 编辑
摘要: 来自xjy的签到题 来自xjy的签到题 来自xjy的签到题 Description 爱丽丝冒险来到了红皇后一个n*n大小的花园,每个格子由'.'或'#'表示,'.'表示爱丽丝可以到达这个格子,‘#’表示爱丽丝不能到达这个格子,爱丽丝每1分钟可以移动到非'#'的相邻格子(与当前所在格子具有公共边)。花 阅读全文
posted @ 2018-08-31 21:37 yzm10 阅读(210) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 9 ··· 16 下一页