Cod sursa(job #1221236)
Utilizator | Data | 19 august 2014 22:01:40 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int nr,d,x,a[1001],i,s,t;
int main()
{
f>>t;
for(i=1;i<=t;i++)
f>>a[i];
for(i=1;i<=t;i++)
{
nr=0;
s=0;
for(d=1;d<=a[i];d++)
{
if(a[i]%d==0)
{
nr++;
s=s+d;
}
}
x=s%9973;
g<<nr<<" "<<x<<'\n';
}
return 0;
}