Cod sursa(job #720600)
| Utilizator | Data | 22 martie 2012 19:35:40 | |
|---|---|---|---|
| Problema | Suma divizorilor | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.36 kb |
#include<fstream>
#include<cmath>
#define modulo 9901
using namespace std;
ifstream f("sumdiv.in");
ofstream g("sumdiv.out");
double n,power;
int rez;
inline long nrdiv(long x)
{
long int sum=0;
for(long int i=1;i<=x;i++)
if(x%i==0)
sum+=i;
return sum;
}
int main()
{
f>>n>>power;
rez=pow(n,power);
g<<nrdiv(rez)%modulo;
return 0;
}
