Cod sursa(job #830089)
Utilizator | Data | 6 decembrie 2012 13:14:20 | |
---|---|---|---|
Problema | Suma divizorilor | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream>
#include<cmath>
using namespace std;
long A,B,s,n=1,nr,a[10001],d[10001];
int i,j;
ifstream f("sumdiv.in");
ofstream g("sumdiv.out");
int main()
{
f>>A>>B;
n=pow(A,B);
for(i=1;i<=n;i++)
{
if(a[i]==0)
{
if(n%i==0)
{
nr++;
d[nr]=i;
}
}
}
for(i=1;i<=nr;i++)
{
s+=d[i];
g<<d[i]<<" ";
}
g<<"\n";
g<<s%9901;
}