Cod sursa(job #2381926)
| Utilizator | Data | 17 martie 2019 14:19:03 | |
|---|---|---|---|
| Problema | Suma divizorilor | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <iostream>
#define MOD 9901
using namespace std;
long long int lgput(long long int A, long long int B, long long int C) {
long long int y = 1;
if(B == 0 || A == 1)
return 1;
while(B > 1)
if(B % 2 == 0) {
B = B / 2;
A = A * A % C;
} else {
B = (B - 1) / 2;
y = y * A % C;
A = A * A % C;
}
return A * y % C;
}
int solve(long long int A, long long int B) {
return ((lgput(A,B,MOD)-1)*A/(A-1)%MOD+1)%MOD;
}
int main()
{
cout <<solve(2,4);
return 0;
}
