上一页 1 2 3 4 5 6 7 8 9 10 ··· 52 下一页
摘要:Biggest Number 时间限制:1000 ms | 内存限制:65535 KB 难度:4 You have a maze with obstacles and non-zero digits in it: You can start from any square, walk in the 阅读全文
posted @ 2016-08-22 23:51 樱花庄的龙之介大人 阅读 (230) 评论 (0) 编辑
摘要:1551: Longest Increasing Subsequence Again Description Give you a numeric sequence. If you can demolish arbitrary amount of numbers, what is the lengt 阅读全文
posted @ 2016-08-22 10:41 樱花庄的龙之介大人 阅读 (85) 评论 (0) 编辑
摘要:1555: Inversion Sequence Description For sequence i1, i2, i3, … , iN, we set aj to be the number of members in the sequence which are prior to j and g 阅读全文
posted @ 2016-08-21 20:21 樱花庄的龙之介大人 阅读 (227) 评论 (0) 编辑
摘要:1552: Friends Description On an alien planet, every extraterrestrial is born with a number. If the sum of two numbers is a prime number, then two extr 阅读全文
posted @ 2016-08-21 17:48 樱花庄的龙之介大人 阅读 (60) 评论 (0) 编辑
摘要:1553: Good subsequence Description Give you a sequence of n numbers, and a number k you should find the max length of Good subsequence. Good subsequen 阅读全文
posted @ 2016-08-21 16:55 樱花庄的龙之介大人 阅读 (66) 评论 (0) 编辑
摘要:1556: Jerry's trouble Description Jerry is caught by Tom. He was penned up in one room with a door, which only can be opened by its code. The code is 阅读全文
posted @ 2016-08-21 16:05 樱花庄的龙之介大人 阅读 (41) 评论 (0) 编辑
摘要:1549: Navigition Problem Description Navigation is a field of study that focuses on the process of monitoring and controlling the movement of a craft 阅读全文
posted @ 2016-08-21 15:52 樱花庄的龙之介大人 阅读 (136) 评论 (0) 编辑
摘要:1550: Simple String Description Welcome,this is the 2015 3th Multiple Universities Programming Contest ,Changsha ,Hunan Province. In order to let you 阅读全文
posted @ 2016-08-21 13:11 樱花庄的龙之介大人 阅读 (38) 评论 (0) 编辑
摘要:1548: Design road Description You need to design road from (0, 0) to (x, y) in plane with the lowest cost. Unfortunately, there are N Rivers between ( 阅读全文
posted @ 2016-08-21 10:28 樱花庄的龙之介大人 阅读 (51) 评论 (0) 编辑
摘要:1547: Rectangle Description Now ,there are some rectangles. The area of these rectangles is 1* x or 2 * x ,and now you need find a big enough rectangl 阅读全文
posted @ 2016-08-21 09:43 樱花庄的龙之介大人 阅读 (56) 评论 (0) 编辑
上一页 1 2 3 4 5 6 7 8 9 10 ··· 52 下一页