2017年9月22日
HDU 1010 - Tempter of the Bone（DFS 奇偶剪枝）
摘要： DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and... 阅读全文
posted @ 2017-09-22 18:01 passwd.d 阅读(101) 评论(0) 推荐(0)
HDU 1009 - FatMouse' Trade（贪心）
摘要： DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.... 阅读全文
posted @ 2017-09-22 18:01 passwd.d 阅读(66) 评论(0) 推荐(0)
POJ 2431 - Expedition (贪心 优先队列)
摘要： DescriptionA group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunate... 阅读全文
posted @ 2017-09-22 18:01 passwd.d 阅读(176) 评论(0) 推荐(0)
POJ 3069 - Saruman's Army(贪心)
摘要： DescriptionSaruman the White must lead his army along a straight path from Isengard to Helm’s Deep. To keep track of his forces, Saruman distr... 阅读全文
posted @ 2017-09-22 18:01 passwd.d 阅读(113) 评论(0) 推荐(0)
Code Forces 588A - Duff and Meat（贪心）
摘要： DescriptionDuff is addicted to meat! Malek wants to keep her happy for n days. In order to be happy in i-th day, she needs to eat exactly ai k... 阅读全文
posted @ 2017-09-22 18:01 passwd.d 阅读(234) 评论(0) 推荐(0)
Code Forces 587A - Duff and Weight Lifting（贪心）
摘要： DescriptionRecently, Duff has been practicing weight lifting. As a hard practice, Malek gave her a task. He gave her a sequence of weights. We... 阅读全文
posted @ 2017-09-22 18:01 passwd.d 阅读(129) 评论(0) 推荐(0)
Codeforces 581C - Developing Skills(贪心)
摘要： DescriptionPetya loves computer games. Finally a game that he’s been waiting for so long came out!The main character of this game has n differ... 阅读全文
posted @ 2017-09-22 18:01 passwd.d 阅读(104) 评论(0) 推荐(0)
POJ 3233 - Matrix Power Series（矩阵快速幂）
摘要： DescriptionGiven a n × n matrix A and a positive integer k, find the sum S=A+A2+A3+…+Ak.InputThe input contains exactly one test case. The fir... 阅读全文
posted @ 2017-09-22 18:01 passwd.d 阅读(89) 评论(0) 推荐(0)
POJ 3070 - Fibonacci (矩阵快速幂)
摘要： DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibo... 阅读全文
posted @ 2017-09-22 18:01 passwd.d 阅读(118) 评论(0) 推荐(0)
UVA 10006 - Carmichael Numbers(卡迈克尔数 快速幂算法)
摘要： DescriptionAn important topic nowadays in computer science is cryptography. Some people even think that cryptography is the only important fie... 阅读全文
posted @ 2017-09-22 18:01 passwd.d 阅读(669) 评论(0) 推荐(0)