Cod sursa(job #634123)
Utilizator | Data | 15 noiembrie 2011 18:17:05 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
const int MOD = 9973;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
int main()
{
long long n,t,i,j,nr,s;
fin>>t;
for(i=1;i<=t;i++)
{
fin>>n;
nr = 0 ; s = 0;
for(j = 1; j <= n; ++j)
if(n % j == 0)
{
nr++;
s=s+j;
s=s%MOD;
}
fout<<nr<<s<<"\n";
}
}