题目概述:S = n^1 + n^2 + n^3 +...... + n^k,已知n、k,求S除以9901的余数。
根据费马小定理:假如p是质数,且(a,p)=1(即a,p互质),那么 a^(p-1) ≡1(mod p)。可知9901是质数,所以n^9900%9901=1,即存在:
( n^ (9900+m)) % 9901 = ( n^9900 * n^m ) % 9901 = ( n^9900 % 9901 * n^m ) % 9901 = n^m % 9901
以此类推,以9900为一个周期,故原问题变为:
n^1 + n^2 + n^3 +...... + n^k mod 9901 =((n^1 + ... + n^9900)(k/9900)+(n^1 + ... + n^(k% 9900)) ) mod9901
设data[i]为n的前i次方之和模除9901的结果,而
n的前i次方之和 = n的前i-1次方之和 * n + n;
则data[i] = ( n * data[i-1] +data[1] ) % 9901,代码如下:
Run Time: 0sec
Run Memory: 312KB
Code Length: 342Bytes
Submit Time: 2013-03-2523:38:23
// Problem#: 2501
// Submission#: 1987366
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <iostream>
using namespace std;
int main()
{
int n, k;
int data[ 9901 ];
cin >> n >> k;
data[ 1 ] = n % 9901;
for ( int i = 2; i < 9901 && i <= k; i++ )
data[ i ] = ( n * data[ i - 1 ] + data[ 1 ] ) % 9901;
cout << ( data[ 9900 ] * ( k / 9900 ) + data[ k % 9900 ] ) % 9901 << endl;
return 0;
}