kuangbin - 博客园

HDU 4423 Simple Function（数学题，2012长春D题）

摘要： Simple FunctionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 111Accepted Submission(s): 31Problem DescriptionKnowing that x can be any real number that x2+ Dx + E ≠ 0. Now, given the following function:What is the range of y?InputThe first line c 阅读全文

posted @ 2013-10-05 23:09 kuangbin 阅读(1203) 评论(0) 推荐(0) 编辑

VIM简单配置（windows）

摘要： 1 set number 2 set history=1000000 3 set tabstop=4 4 set shiftwidth=4 5 6 set smarttab 7 8 set nocp 9 filetype plugin indent on10 11 colo evening12 13 set nobackup14 set noswapfile15 16 set mouse=a17 set selection=exclusive18 set selectmode=mouse,key19 20 map :call CR()21 func! CR()22 exec "w&q 阅读全文

posted @ 2013-10-04 18:20 kuangbin 阅读(1178) 评论(0) 推荐(0) 编辑

LightOJ 1074 - Extended Traffic （SPFA）

摘要： http://lightoj.com/volume_showproblem.php?problem=10741074 - Extended TrafficPDF (English)StatisticsForumTime Limit:2 second(s)Memory Limit:32 MBDhaka city is getting crowded and noisy day by day. Certain roads always remain blocked in congestion. In order to convince people avoid shortest routes, a 阅读全文

posted @ 2013-10-02 23:00 kuangbin 阅读(2218) 评论(1) 推荐(0) 编辑

HDU 4763 Theme Section （2013长春网络赛1005，KMP）

摘要： Theme SectionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 271Accepted Submission(s): 121Problem DescriptionIt's time for music! A lot of popular musicians are invited to join us in the music festival. Each of them will play one of their repr 阅读全文

posted @ 2013-09-29 19:00 kuangbin 阅读(1940) 评论(0) 推荐(0) 编辑

HDU 4764 Stone (2013长春网络赛，水博弈)

摘要： StoneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 179Accepted Submission(s): 137Problem DescriptionTang and Jiang are good friends. To decide whose treat it is for dinner, they are playing a game. Specifically, Tang and Jiang will alternatively 阅读全文

posted @ 2013-09-29 17:33 kuangbin 阅读(1427) 评论(0) 推荐(0) 编辑

HDU 4762 Cut the Cake （2013长春网络赛1004题，公式题）

摘要： Cut the CakeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 300Accepted Submission(s): 135Problem DescriptionMMM got a big big big cake, and invited all her M friends to eat the cake together. Surprisingly one of her friends HZ took some (N) strawb 阅读全文

posted @ 2013-09-29 17:30 kuangbin 阅读(1675) 评论(0) 推荐(0) 编辑

HDU 4759 Poker Shuffle（2013长春网络赛1001题）

摘要： Poker ShuffleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 95Accepted Submission(s): 24Problem DescriptionJason is not only an ACMer, but also a poker nerd. He is able to do a perfect shuffle. In a perfect shuffle, the deck containing K cards, wh 阅读全文

posted @ 2013-09-29 16:56 kuangbin 阅读(1396) 评论(0) 推荐(0) 编辑

HDU 4768 Flyer （2013长春网络赛1010题，二分）

摘要： FlyerTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 386Accepted Submission(s): 127Problem DescriptionThe new semester begins! Different kinds of student societies are all trying to advertise themselves, by giving flyers to the students for introdu 阅读全文

posted @ 2013-09-29 00:00 kuangbin 阅读(1245) 评论(0) 推荐(1) 编辑

HDU 4751 Divide Groups （2013南京网络赛1004题，判断二分图）

摘要： Divide GroupsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 423Accepted Submission(s): 161Problem DescriptionThis year is the 60th anniversary of NJUST, and to make the celebration more colorful, Tom200 is going to invite distinguished alumnus bac 阅读全文

posted @ 2013-09-22 12:17 kuangbin 阅读(1304) 评论(0) 推荐(0) 编辑

HDU 4750 Count The Pairs （2013南京网络赛1003题，并查集）

摘要： Count The PairsTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 277Accepted Submission(s): 150Problem DescriptionWith the 60th anniversary celebration of Nanjing University of Science and Technology coming soon, the university sets n tourist spots 阅读全文

posted @ 2013-09-22 12:15 kuangbin 阅读(713) 评论(0) 推荐(0) 编辑