Cod sursa(job #2220369)
Utilizator | Data | 11 iulie 2018 15:49:15 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#define MOD 9973
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
long long t,n,s,nr,i;
int main()
{
f>>t;
while(t--)
{
f>>n;
s=nr=0;
for(i=1;i*i<=n;i++)
{
if(n%i==0)
{
s=(s+i)%MOD;
nr++;
if(n/i!=i)
{
nr++;
s=(s+n/i)%MOD;
}
}
}
g<<nr<<" "<<s<<"\n";
}
return 0;
}