Cod sursa(job #903325)
| Utilizator | Data | 1 martie 2013 20:00:45 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
using namespace std;
char v[2000000];
long main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long c,n,i,j,t,i2,rest;
fin>>t;
for(i2=1;i2<=t;i2++)
{
s=0;
c=0;
fin>>n;
for(i=1;i*i<n;i++)
{
if(n%i==0)
{
c=c+2;
s=(s+i+n/i)%9973;
}
}
if(i*i==n) {c++;
s=(s+i)%9973;}
}
fout<<c<<" "<<s<<"\n";
fin.close();
fout.close();
return 0;
}
