- 博客(9)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 15北京网络赛 E题
题目描述：题目5 : Border Length时间限制:1000ms单点时限:1000ms内存限制:256MB描述Garlic-Counting Chicken is a special species living around the Lake of Peking University.A Garlic-Counting Chicken always flies out from home i
2015-09-25 12:06:29
380
原创 15北京网络赛 B题
题目描述：题目2 : Mission Impossible 6时间限制:1000ms单点时限:1000ms内存限制:256MB描述You must have seen the very famous movie series,”Mission Impossible”, from 1 to 4. And “Mission Impossible 5” is now on screen in China.
2015-09-24 14:56:41
798
原创 HDU5361 In Touch
题目描述：In Touch Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1634 Accepted Submission(s): 440Problem DescriptionThere are n soda living
2015-09-24 14:45:38
327
原创 HDU 5120 Intersection
题目描述：Matt is a big fan of logo design. Recently he falls in love with logo made up by rings. The following figures are some famous examples you may know. A ring is a 2-D figure bounded by two circles s
2015-09-16 18:49:30
279
原创 HDU 5117 Fluorescent
题目描述：DescriptionMatt, a famous adventurer who once defeated a pack of dire wolves alone, found a lost court. Matt finds that there are N fluorescent lights which seem to be the stars from the firmament
2015-09-16 17:10:55
399
原创 2014北京 HDU 5113 Black And White
题目描述：In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colo
2015-09-16 16:45:00
318
原创 codeforces 318 D. Bear and Cavalry
题目描述：D. Bear and Cavalrytime limit per test:3 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputWould you want to fight against bears riding horses? Me neither.Limak i
2015-09-10 16:45:32
489
原创 codeforces 317 B. Minimization
题目描述：You’ve got array A, consisting of n integers and a positive integer k. Array A is indexed by integers from 1 to n.You need to permute the array elements so that value (就是错k个相减)became minimal pos
2015-09-09 11:50:08
379
原创 codeforces 317 A - Lengthening Sticks
题目描述：You are given three sticks with positive integer lengths of a, b, and c centimeters. You can increase length of some of them by some positive integer number of centimeters (different sticks can be
2015-09-09 11:31:42
334
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人