Pagini recente » Borderou de evaluare (job #3125654) | Borderou de evaluare (job #2567105) | Diferente pentru problema/secvente intre reviziile 32 si 49 | Borderou de evaluare (job #2259808) | Cod sursa (job #808741)
Cod sursa(job #808741)
#include <iostream>
#include <stdio.h>
#define MOD 9901
using namespace std;
long long power(long long x, long long y)
{
long long p = 1;
while (y > 0)
{
if (y % 2 == 1)
{
p *= x;
p %= MOD;
}
y = y / 2;
x *= x;
x %= MOD;
}
return p % MOD;
}
int main()
{
FILE *input = fopen("sumdiv.in","r");
FILE *output = fopen("sumdiv.out","w");
long long a;
long long b;
fscanf(input,"%lld",&a);
fscanf(input,"%lld",&b);
long long answer = ( ( power(a,b+1) -1 ) / (a - 1) ) % MOD;
fprintf(output,"%lld",answer);
fclose(input);
fclose(output);
cout << "Hello world!" << endl;
return 0;
}