Cod sursa(job #568066)
Utilizator | Iorga Andreea andreea29 | Data | 30 martie 2011 19:52:00 |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
int main()
{unsigned long long n[1000], j, s, c;
int t, i, OK, r;
ifstream f("ssnd.in");
ofstream h("ssnd.out");
f>>t;
for (i=1; i<=t; i++)
f>>n[i];
for (i=1; i<=t; i++)
{c=0;
s=0;
for (j=1; j<=n[i]; j++)
{OK=1;
if (n[i]%j==0)
OK=0;
if (OK==0)
{c++;
s=s+j;}
}
h<<c<<" ";
r=s%9973;
h<<r<<endl;
}
f.close();
h.close();
return 0;
}