摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=2817学习 ：//(a × b) mod c=( (a mod c) × b) mod c. （a+b）mod c=（a mod c+b mod c）mod c；在题目中我们总会遇到 a^b mod n 所以我们必须用 快速幂取模算法，下面就是快速快速幂取模算法，这些强制类型转换应该要多学习学习。题意是等比数列或者等差数列，求第k个数。求余200907。 A sequence of numbersTime Limit: 2000/1000 MS (Java/Others) Memory L 阅读全文
摘要：
http://acm.hdu.edu.cn/status.php Alfredo's Pizza RestaurantTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1732 Accepted Submission(s): 1023 Problem DescriptionTraditionally after the Local Contest, judges and contestants go to their favourit 阅读全文