Cod sursa(job #569836)
| Utilizator |  Andrei Dinu informatician28 |
Data | 2 aprilie 2011 11:56:19 |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int main()
{long long d,t,i,s,s2,n;
f>>t;
for(i=1;i<=t;i++)
{f>>n;
s=0;
s2=0;
for(d=1;d<=n;d++)
{if(n%d==0) {s+=1; s2+=d;}}g<<s<<" "<<s2%9973<<'\n'; }
f.close(); g.close();
}
