xyiyy - 博客园

poj1418 Viva Confetti 判断圆是否可见

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudViva ConfettiTime Limit:1000MSMemory Limit:10000KTotal Submissions:881Accepted:361DescriptionDo you kn... 阅读全文

posted @ 2015-08-31 16:02 xyiyy 阅读(593) 评论(0) 推荐(0)

poj1981 Circle and Points 单位圆覆盖问题

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudCircle and PointsTime Limit:5000MSMemory Limit:30000KTotal Submissions:6850Accepted:2443Case Time Limi... 阅读全文

posted @ 2015-08-31 15:46 xyiyy 阅读(774) 评论(0) 推荐(0)

poj2187 Beauty Contest(旋转卡壳)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudBeauty ContestTime Limit:3000MSMemory Limit:65536KTotal Submissions:31214Accepted:9681DescriptionBessi... 阅读全文

posted @ 2015-08-30 23:55 xyiyy 阅读(330) 评论(0) 推荐(0)

poj2932 Coneology (扫描线)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudConeologyTime Limit:5000MSMemory Limit:65536KTotal Submissions:3289Accepted:586DescriptionA student na... 阅读全文

posted @ 2015-08-30 23:37 xyiyy 阅读(664) 评论(0) 推荐(0)

poj1127 Jack Straws(线段相交+并查集)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudJack StrawsTime Limit:1000MSMemory Limit:10000KTotal Submissions:3512Accepted:1601DescriptionIn the ga... 阅读全文

posted @ 2015-08-30 23:30 xyiyy 阅读(325) 评论(0) 推荐(0)

hihoCoder挑战赛14 A,B,C题解

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraud题目1 : 不等式时间限制:10000ms单点时限:1000ms内存限制:256MB描述给定n个关于X的不等式，问最多有多少个成立。每个不等式为如下的形式之一：X CX >= C输入第一行一个整数n。以... 阅读全文

posted @ 2015-08-30 23:25 xyiyy 阅读(555) 评论(0) 推荐(0)

Codeforces Round #318(Div 1) 573A, 573B,573C

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraud这场的前两题完全是手速题。。。A题写了7分钟，交的时候已经500+了，好在B题出的速度勉强凑活吧，and C题也没有FSTA. Bear and PokerLimak is an old brown be... 阅读全文

posted @ 2015-08-30 15:00 xyiyy 阅读(1764) 评论(0) 推荐(0)

hdu5398 GCD Tree(lct)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudGCD TreeTime Limit: 5000/2500 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submissio... 阅读全文

posted @ 2015-08-18 23:52 xyiyy 阅读(435) 评论(0) 推荐(0)

ZOJ3558 How Many Sets III(公式题)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudHow Many Sets IIITime Limit:2 Seconds Memory Limit:65536 KBGiven a setS= {1, 2, ...,n}, your job is to... 阅读全文

posted @ 2015-08-16 01:21 xyiyy 阅读(272) 评论(0) 推荐(0)

ZOJ3557 How Many Sets II( Lucas定理)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudHow Many Sets IITime Limit:2 Seconds Memory Limit:65536 KBGiven a setS= {1, 2, ...,n}, numbermandp, yo... 阅读全文

posted @ 2015-08-16 01:09 xyiyy 阅读(421) 评论(0) 推荐(0)

ZOJ3556 How Many Sets I(容斥)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudHow Many Sets ITime Limit:2 Seconds Memory Limit:65536 KBGive a set S, |S| =n, then how many ordered s... 阅读全文

posted @ 2015-08-16 01:05 xyiyy 阅读(249) 评论(0) 推荐(0)

ZOJ3555 Ice Climber(dp)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudIce ClimberTime Limit:2 Seconds Memory Limit:32768 KBMaybe many one have played or at least heard ofTh... 阅读全文

posted @ 2015-08-16 01:01 xyiyy 阅读(284) 评论(0) 推荐(0)

ZOJ3554 A Miser Boss(dp)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudA Miser BossTime Limit:2 Seconds Memory Limit:65536 KBThere are three different lathes in a factory na... 阅读全文

posted @ 2015-08-16 00:54 xyiyy 阅读(315) 评论(0) 推荐(0)

ZOJ3551 Bloodsucker(概率dp)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudBloodsuckerTime Limit:2 Seconds Memory Limit:65536 KBIn 0th day, there aren-1people and 1 bloodsucker.... 阅读全文

posted @ 2015-08-16 00:49 xyiyy 阅读(436) 评论(0) 推荐(0)

ZOJ3549 Little Keng(快速幂)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudLittle KengTime Limit:2 Seconds Memory Limit:65536 KBCalculate how many 0s at the end of the value bel... 阅读全文

posted @ 2015-08-16 00:41 xyiyy 阅读(209) 评论(0) 推荐(0)

hdu5392 Infoplane in Tina Town(LCM)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudInfoplane in Tina TownTime Limit: 14000/7000 MS (Java/Others)Memory Limit: 524288/524288 K (Java/Other... 阅读全文

posted @ 2015-08-16 00:24 xyiyy 阅读(341) 评论(0) 推荐(0)

hdu5391 Zball in Tina Town(威尔逊定理)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudZball in Tina TownTime Limit: 3000/1500 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others)Tot... 阅读全文

posted @ 2015-08-16 00:17 xyiyy 阅读(314) 评论(0) 推荐(0)

uva12486 Space Elevator(数位dp)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraud题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=279&page=show_prob... 阅读全文

posted @ 2015-08-14 21:18 xyiyy 阅读(147) 评论(0) 推荐(0)

uva12489 Combating cancer(树同构)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudhttps://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3933给你... 阅读全文

posted @ 2015-08-14 20:46 xyiyy 阅读(257) 评论(0) 推荐(0)

hdu5362 Just A String(dp)

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudJust A StringTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Su... 阅读全文

posted @ 2015-08-07 22:23 xyiyy 阅读(368) 评论(0) 推荐(0)