Cod sursa(job #1621672)
Utilizator | Amarandei-Stanescu Alexandru turbowin120 | Data | 29 februarie 2016 20:42:50 |
---|---|---|---|
Problema | Suma divizorilor | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
const int MOD=9901;
long long n,p,sol=1,sum=1;
int main()
{
FILE * in;
in=fopen("sumdiv.in", "r");
fscanf(in,"%lld%lld",&n,&p);
p=p%MOD;
while(p){
if(p&1){
sol=(sol*n)%MOD;
sum+=n;
}
n=(n*n)%MOD;
p/=2;
}
sum+=sol;
sum=sum%MOD;
FILE * out;
out=fopen("sumdiv.out", "w");
fprintf(out,"%lld",sum);
return 0;
}