- 博客(19)
- 资源 (4)
- 问答 (2)
- 收藏
- 关注
原创 Power Strings
Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticePOJ 2406 Appoint description: Description Given two strings a and b we define a*b to be their conca
2015-07-31 19:05:45 243
原创 多校3- RGCDQ
RGCDQ Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 5317 Appoint description: Description Mr. Hdu is interested in Greatest Common Divisor (
2015-07-31 10:50:31 311
原创 多校3-Magician
MagicianTime Limit: 18000/9000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1771 Accepted Submission(s): 515Problem DescriptionFantasy magicians
2015-07-31 08:13:01 428
原创 H - Solve this interesting problem
Have you learned something about segment tree? If not, don’t worry, I will explain it for you. Segment Tree is a kind of binary tree, it can be defined as this: - For each node u in Segment Tree,
2015-07-29 21:06:12 428
原创 多校赛3- Solve this interesting problem
H - Solve this interesting problemTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 5323Appoint description: System Crawler (2015-
2015-07-29 21:01:10 294
原创 多校赛3- Painter
D - Painter Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 5319 Appoint description: Description Mr. Hdu is an painter, as we all know, paint
2015-07-29 19:58:08 303
原创 K - Work
K - WorkTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 5326Appoint description: System Crawler (2015-07-28)Description
2015-07-29 19:13:04 855
原创 Drainage Ditches
Drainage Ditches Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 62016 Accepted: 23808 Description Every time it rains on Farmer John’s fields, a pond forms over Bessie’s fav
2015-07-29 15:01:34 470
原创 Power Network
Power Network Time Limit: 2000MS Memory Limit: 32768K Total Submissions: 24867 Accepted: 12958Description A power network consists of nodes (power stations, consumers and dispatchers) co
2015-07-29 13:55:19 439
原创 Labeling Balls
Labeling Balls Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11893 Accepted: 3408DescriptionWindy has N balls of distinct weights from 1 unit to N units. Now he tries to labe
2015-07-28 19:47:02 351
原创 Network
Network Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 14721 Accepted: 5777 Special JudgeDescription Andrew is working as system administrator and is planning to establi
2015-07-27 17:18:52 412
原创 Borg Maze
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9971 Accepted: 3347DescriptionThe Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of
2015-07-27 15:28:42 762
原创 Case of the Zeros and Ones
A. Case of the Zeros and Onestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndrewid the Android is a galaxy-famous
2015-07-24 11:05:58 474
原创 滑雪
滑雪 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 83276 Accepted: 31159 Description Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡
2015-07-23 19:48:24 566
原创 Wormholes
WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 35235 Accepted: 12861DescriptionWhile exploring his many farms, Farmer John has discovered a nu
2015-07-14 20:21:39 516
原创 Currency Exchange
Currency Exchange Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 22180 Accepted: 8015Description Several currency exchange points are working in our city. Let us suppose that
2015-07-14 16:20:45 857
原创 Children of the Candy Corn
Children of the Candy CornTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10933 Accepted: 4708DescriptionThe cornfield maze is a popular Halloween treat.
2015-07-14 08:19:46 311
原创 {A} + {B}
{A} + {B}Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14601 Accepted Submission(s): 6099Problem Description给你两个集合,要求{A} + {B}
2015-07-11 18:06:33 614
原创 Finding Nemo
Finding NemoTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 8117 Accepted: 1883DescriptionNemo is a naughty boy. One day he went into the deep sea all by
2015-07-11 10:11:06 664
OCLSDKLightAMD.zip
2019-10-15
ZOJ2676最小割01规划问题
2016-02-25
最小割在图论中的应用问题
2016-02-24
TA创建的收藏夹 TA关注的收藏夹
TA关注的人