上一页 1 ··· 28 29 30 31 32 33 34 35 36 ··· 66 下一页
摘要: Hackers’ Crackdown Miracle Corporations has a number of system services running in a distributed computer system which is a prime target for hackers. 阅读全文
posted @ 2016-04-04 13:38 meekyan 阅读(292) 评论(0) 推荐(0) 编辑
摘要: Defense Lines After the last war devastated your country, you - as the king of the land of Ardenia - decided it washigh time to improve the defense of 阅读全文
posted @ 2016-04-03 19:30 meekyan 阅读(263) 评论(0) 推荐(0) 编辑
摘要: Magical GCD The Magical GCD of a nonempty sequence of positive integers is defined as the product of its lengthand the greatest common divisor of all i 阅读全文
posted @ 2016-04-03 13:55 meekyan 阅读(442) 评论(0) 推荐(0) 编辑
摘要: E. Pig and Palindromes E. Pig and Palindromes Peppa the Pig was walking and walked into the forest. What a strange coincidence! The forest has the sha 阅读全文
posted @ 2016-04-01 22:41 meekyan 阅读(192) 评论(0) 推荐(0) 编辑
摘要: 第k大区间 第k大区间 第k大区间 定义一个区间的值为其众数出现的次数。现给出n个数,求将所有区间的值排序后,第K大的值为多少。 定义一个区间的值为其众数出现的次数。现给出n个数,求将所有区间的值排序后,第K大的值为多少。 定义一个区间的值为其众数出现的次数。现给出n个数,求将所有区间的值排序后,第 阅读全文
posted @ 2016-03-30 19:51 meekyan 阅读(324) 评论(0) 推荐(0) 编辑
摘要: xiaoxin and his watermelon candy Problem Description During his six grade summer vacation, xiaoxin got lots of watermelon candies from his leader when 阅读全文
posted @ 2016-03-30 13:36 meekyan 阅读(204) 评论(0) 推荐(0) 编辑
摘要: Bomber Man wants to bomb an Array. Problem Description Given an array and some positions where to plant the bombs, You have to print the Total Maximum 阅读全文
posted @ 2016-03-29 22:39 meekyan 阅读(303) 评论(0) 推荐(0) 编辑
摘要: India and China Origins Problem Description A long time ago there are no himalayas between India and China, the both cultures are frequently exchanged 阅读全文
posted @ 2016-03-28 22:30 meekyan 阅读(197) 评论(0) 推荐(0) 编辑
摘要: ZYB's Premutation Memory Limit: 131072/131072 K (Java/Others) ZYB's Premutation Memory Limit: 131072/131072 K (Java/Others) Memory Limit: 131072/13107 阅读全文
posted @ 2016-03-24 23:00 meekyan 阅读(208) 评论(0) 推荐(0) 编辑
摘要: Queue Problem Description N people numbered from 1 to N are waiting in a bank for service. They all stand in a queue, but the queue never moves. It is 阅读全文
posted @ 2016-03-24 22:41 meekyan 阅读(244) 评论(0) 推荐(0) 编辑
上一页 1 ··· 28 29 30 31 32 33 34 35 36 ··· 66 下一页