Cod sursa(job #1012852)
Utilizator | Data | 19 octombrie 2013 18:36:38 | |
---|---|---|---|
Problema | Suma divizorilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | micuti1 | Marime | 0.3 kb |
#include<fstream>
#include<math.h>
using namespace std;
int main()
{
int s=0,div[50000000],a,b,n,i,r;
ifstream f("sumdiv.in");
ofstream g("sumdiv.out");
f>>a>>b;
n=pow(a,b);
for(i=1;i<=n;i++)
f>>div[i];
for(i=1;i<=n;i++)
if(n%div[i]==0)
s=s+div[i];
s%9901==r;
g<<r;
}