Cod sursa(job #1387647)
| Utilizator | Data | 14 martie 2015 15:38:05 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include<fstream>
using namespace std;
int t,i,div;
long long n,s,j;
int main ()
{
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
fin>>t;
for(i=1;i<=t;i++)
{
fin>>n;
s=0;
div=0;
for(j=1;j<=n/j;j++)
{
if(n%j==0)
{
if(j==n/j)
{
div=div+1;
s=(s+j)%9973;
}
else
{
div=div+2;
s=(s+j+n/j)%9973;
}
}
}
fout<<div<<" "<<s<<"\n";
}
fin.close();
fout.close();
return 0;
}
