Cod sursa(job #2930934)
Utilizator | Data | 29 octombrie 2022 21:13:36 | |
---|---|---|---|
Problema | Suma divizorilor | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream in("sumdiv.in");
ofstream out("sumdiv.out");
int main()
{
long long d = 2, n, p, e, s = 1;
in >> n >> p;
while(n > 1){
e = 0;
while(n % d == 0){
e++;
n /= d;
}
if(e > 0){
s = s * ( (pow(d, e * p + 1) - 1) / (d - 1) );
s = s % 9901;
}
}
out << s;
return 0;
}