Cod sursa(job #379078)
Utilizator | Data | 30 decembrie 2009 15:20:00 | |
---|---|---|---|
Problema | Suma divizorilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include<stdio.h>
#define m 9901;
long long mod=1,a,b,n,l,sum;
int main()
{
FILE *f=fopen("lgput.in","r");
FILE *g=fopen("lgput.out","w");
fscanf(f,"%lld %d",&a,&b);
n=b+1;
l=a;
while(n>0)
{
if(n%2==1)
mod=mod*a;
a=a*a;
n=n/2;
}
sum=((mod-1)/(l-1))% m;
fprintf(g,"%lld",sum);
fclose(f);
fclose(g);
return 0;
}