Cod sursa(job #1321272)
Utilizator | Data | 18 ianuarie 2015 22:16:06 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream x ("ssnd.in");
ofstream y ("ssnd.out");
int main()
{
int t,s[2000],i,n[2000],j,nr[2000];
x>>t;
for(i=1; i<=t; i++)
{
x>>n[i];
s[i]=0;
nr[i]=0;
}
for(i=1; i<=t; i++)
for(j=1; j<=n[i]; j++)
if(n[i]%j==0)
{
nr[i]++;
s[i]=s[i]+j;
}
for(i=1; i<=t; i++)
y<<nr[i]<<" "<<s[i]%9973<<'\n';
}