Cod sursa(job #749349)
Utilizator | Data | 16 mai 2012 18:43:46 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
long int t,a[10000000],n,d,s,nr,i;
int main()
{
f>>t;
for(i=1;i<=t;i++)
f>>a[i];
for(i=1;i<=t;i++)
{
s=1+a[i];
nr=2;
for(d=2;d<=a[i]/2;d++)
if(a[i]%d==0)
{
s=s+d;
nr++;
}
g<<nr<<" "<<s%9973<<"\n";
}
return 0;
}