07 2014 档案

uva 10290 {Sum+=i++} to Reach N （数论-整数和素数）
摘要：Problem H{sum+=i++} to Reach NInput:standard inputOutput:standard outputMemory Limit:32 MBAll the positive numbers can be expressed as a sum of one, t... 阅读全文
posted @ 2014-07-31 20:00 炒饭君 阅读(217) 评论(0) 推荐(0)
uva 10168 Summation of Four Primes（数论-哥德巴赫猜想）
摘要：Problem ASummation of Four PrimesInput:standard inputOutput:standard outputTime Limit:4 secondsEuler proved in one of his classic theorems that prime ... 阅读全文
posted @ 2014-07-31 17:42 炒饭君 阅读(263) 评论(0) 推荐(0)
HDU 1695 GCD （数论-整数和素数，组合数学-容斥原理）
摘要：GCDProblem DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common d... 阅读全文
posted @ 2014-07-31 17:37 炒饭君 阅读(185) 评论(0) 推荐(0)
HDU 2647 Reward（图论-拓扑排序）
摘要：RewardProblem DescriptionDandelion's uncle is a boss of a factory. As the spring festival is coming , he wants to distribute rewards to his workers. N... 阅读全文
posted @ 2014-07-31 14:51 炒饭君 阅读(135) 评论(0) 推荐(0)
HDU 3988 Harry Potter and the Hide Story（数论-整数和素数）
摘要：Harry Potter and the Hide StoryProblem DescriptioniSea is tired of writing the story of Harry Potter, so, lucky you, solving the following problem is ... 阅读全文
posted @ 2014-07-31 14:08 炒饭君 阅读(337) 评论(0) 推荐(0)
POJ 1984 Navigation Nightmare （数据结构-并查集）
摘要：Navigation NightmareTime Limit:2000MSMemory Limit:30000KTotal Submissions:4072Accepted:1615Case Time Limit:1000MSDescriptionFarmer John's pastoral nei... 阅读全文
posted @ 2014-07-30 21:08 炒饭君 阅读(205) 评论(0) 推荐(0)
POJ 1703 Find them, Catch them （数据结构-并查集）
摘要：Find them, Catch themTime Limit:1000MSMemory Limit:10000KTotal Submissions:31102Accepted:9583DescriptionThe police office in Tadu City decides to say ... 阅读全文
posted @ 2014-07-30 16:18 炒饭君 阅读(170) 评论(0) 推荐(0)
POJ 3367 Expressions（数据结构-二叉树）
摘要：ExpressionsTime Limit:1000MSMemory Limit:65536KTotal Submissions:2314Accepted:760DescriptionArithmetic expressions are usually written with the operat... 阅读全文
posted @ 2014-07-30 13:51 炒饭君 阅读(433) 评论(0) 推荐(0)
HDU 1988 Cube Stacking （数据结构-并查集）
摘要：Cube StackingTime Limit:2000MSMemory Limit:30000KTotal Submissions:18834Accepted:6535Case Time Limit:1000MSDescriptionFarmer John and Betsy are playin... 阅读全文
posted @ 2014-07-30 11:42 炒饭君 阅读(170) 评论(0) 推荐(0)
HDU 2594 Simpsons’ Hidden Talents （字符串-KMP）
摘要：Simpsons’ Hidden TalentsProblem DescriptionHomer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.Marge: Yeah,... 阅读全文
posted @ 2014-07-29 20:41 炒饭君 阅读(125) 评论(0) 推荐(0)
HDU 1026 Ignatius and the Princess I （搜索-广度优先搜索）
摘要：Ignatius and the Princess IProblem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Pri... 阅读全文
posted @ 2014-07-29 19:56 炒饭君 阅读(142) 评论(0) 推荐(0)
HDU 1796 How many integers can you find（组合数学-容斥原理）
摘要：How many integers can you findProblem DescriptionNow you get a number N, and a M-integers set, you should find out how many integers which are small t... 阅读全文
posted @ 2014-07-29 16:22 炒饭君 阅读(145) 评论(0) 推荐(0)
uva 10209 Is This Integration ? （计算几何）
摘要：Problem CIs This Integration ?Input:Standard InputOutput:Standard OutputTime Limit:3 secondsIn the image below you can see a square ABCD, whereAB = BC... 阅读全文
posted @ 2014-07-29 13:14 炒饭君 阅读(248) 评论(0) 推荐(0)
POJ 2355 Find a multiple（组合数学-抽屉原理）
摘要：Find a multipleTime Limit:1000MSMemory Limit:65536KTotal Submissions:5881Accepted:2560Special JudgeDescriptionThe input contains N natural (i.e. posit... 阅读全文
posted @ 2014-07-29 12:25 炒饭君 阅读(198) 评论(0) 推荐(0)
POJ 1160 Post Office （动态规划）
摘要：Post OfficeTime Limit:1000MSMemory Limit:10000KTotal Submissions:15412Accepted:8351DescriptionThere is a straight highway with villages alongside the ... 阅读全文
posted @ 2014-07-09 11:13 炒饭君 阅读(199) 评论(0) 推荐(0)
HDU 2829 Lawrence（动态规划-四边形不等式）
摘要：LawrenceProblem DescriptionT. E. Lawrence was a controversial figure during World War I. He was a British officer who served in the Arabian theater an... 阅读全文
posted @ 2014-07-07 16:15 炒饭君 阅读(184) 评论(0) 推荐(0)
HDU 3537 Daizhenyang's Coin（博弈-sg）
摘要：Daizhenyang's CoinProblem DescriptionWe know that Daizhenyang is chasing a girlfriend. As we all know, whenever you chase a beautiful girl, there'll a... 阅读全文
posted @ 2014-07-05 21:20 炒饭君 阅读(189) 评论(0) 推荐(0)
ZOJ 3529 A Game Between Alice and Bob（博弈论-sg函数）
摘要：ZOJ 3529 -A Game Between Alice and BobTime Limit:5000MSMemory Limit:262144KB64bit IO Format:%lld & %lluDescriptionAlice and Bob play the following gam... 阅读全文
posted @ 2014-07-05 19:07 炒饭君 阅读(170) 评论(0) 推荐(0)
HDU 3032 Nim or not Nim? （sg函数求解）
摘要：Nim or not Nim?Problem DescriptionNim is a two-player mathematic game of strategy in which players take turns removing objects from distinct heaps. On... 阅读全文
posted @ 2014-07-05 15:56 炒饭君 阅读(146) 评论(0) 推荐(0)
HDU 1517 A Multiplication Game （博弈-求sg）
摘要：A Multiplication GameProblem DescriptionStan and Ollie play the game of multiplication by multiplying an integer p by one of the numbers 2 to 9. Stan ... 阅读全文
posted @ 2014-07-05 11:54 炒饭君 阅读(186) 评论(0) 推荐(0)
HDU 2897 邂逅明下 （经典博弈变形）
摘要：邂逅明下Problem Description当日遇到月，于是有了明。当我遇到了你，便成了侣。那天，日月相会，我见到了你。而且，大地失去了光辉，你我是否成侣？这注定是个凄美的故事。（以上是废话）小t和所有世俗的人们一样，期待那百年难遇的日食。驻足街头看天，看日月渐渐走近，小t的脖子那个酸呀（他坚持这... 阅读全文
posted @ 2014-07-04 21:04 炒饭君 阅读(140) 评论(0) 推荐(0)
HDU 2149 Public Sale （博弈论经典）
摘要：Public SaleProblem Description虽然不想，但是现实总归是现实，Lele始终没有逃过退学的命运，因为他没有拿到奖学金。现在等待他的，就是像FarmJohn一样的农田生涯。要种田得有田才行，Lele听说街上正在举行一场别开生面的拍卖会，拍卖的物品正好就是一块20亩的田地。于是... 阅读全文
posted @ 2014-07-04 20:33 炒饭君 阅读(206) 评论(0) 推荐(0)
HDU 2516 取石子游戏 （博弈论）
摘要：取石子游戏Problem Description1堆石子有n个,两人轮流取.先取者第1次可以取任意多个，但不能全部取完.以后每次取的石子数不能超过上次取子数的2倍。取完者胜.先取者负输出"Second win".先取者胜输出"First win".Input输入有多组.每组第1行是2#include... 阅读全文
posted @ 2014-07-04 20:10 炒饭君 阅读(170) 评论(0) 推荐(0)
HDU 1847 Good Luck in CET-4 Everybody! （博弈论sg）
摘要：Good Luck in CET-4 Everybody!Problem Description大学英语四级考试就要来临了，你是不是在紧张的复习？也许紧张得连短学期的ACM都没工夫练习了，反正我知道的Kiki和Cici都是如此。当然，作为在考场浸润了十几载的当代大学生，Kiki和Cici更懂得考前的... 阅读全文
posted @ 2014-07-04 19:00 炒饭君 阅读(145) 评论(0) 推荐(0)
HDU 3366 Passage （概率DP）
摘要：PassageProblem DescriptionBill is a millionaire. But unfortunately he was trapped in a castle. There are only n passages to go out. For any passage i ... 阅读全文
posted @ 2014-07-04 16:51 炒饭君 阅读(185) 评论(0) 推荐(0)
ZOJ 3551 Bloodsucker （概率DP）
摘要：ZOJ Problem Set - 3551BloodsuckerTime Limit:2 Seconds Memory Limit:65536 KBIn 0th day, there aren-1people and 1 bloodsucker. Every day, two and only t... 阅读全文
posted @ 2014-07-04 14:50 炒饭君 阅读(189) 评论(0) 推荐(0)
HDU 4652 Dice （概率DP）
摘要：DiceProblem DescriptionYou have a dice with m faces, each face contains a distinct number. We assume when we tossing the dice, each face will occur ra... 阅读全文
posted @ 2014-07-03 18:46 炒饭君 阅读(203) 评论(0) 推荐(0)
HDU 4576 Robot（概率题）
摘要：RobotProblem DescriptionMichael has a telecontrol robot. One day he put the robot on a loop with n cells. The cells are numbered from 1 to n clockwise... 阅读全文
posted @ 2014-07-03 11:17 炒饭君 阅读(204) 评论(0) 推荐(0)