摘要：
HOJ 1016 Joseph's problem IMy Tags(Edit)Source:UnknownTime limit: 10 secMemory limit: 32 MSubmitted: 1484,Accepted: 439The Joseph's problem is notoriously known. For those who are not familiar with the problem, among n people numbered 1,2...n, standing in circle everymthis going to be execut 阅读全文
摘要：
http://acm.hit.edu.cn/hoj/problem/view?id=1991HOJ 1991 Happy 2005My Tags矩阵快速幂(Edit)Source:SCU Programming Contest 2005 PreliminaryTime limit: 1 secMemory limit: 32 MSubmitted: 344,Accepted: 223Consider a positive integer X, and let S be the sum of all positive integer divisors of 2005X. Your job is 阅读全文
摘要：
http://acm.hit.edu.cn/hoj/problem/view?id=2901HOJ 2901 CalculationMy Tags快速幂(Edit)Source:GTmacTime limit: 1 secMemory limit: 32 MSubmitted: 312,Accepted: 105Given two integers a and b, you are to calculate the value of the following expression: (1b+ 2b+ ... + ab) modulo a.Note that b is an odd numbe 阅读全文