Cod sursa(job #561532)
Utilizator | Data | 20 martie 2011 18:11:47 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int main(){
int n,i,a[100],d,s=0,c=0;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
{
s=0;
c=0;
for(d=1;d<=a[i];d++)
{
if(a[i]%d==0)
{c++;s+=d;}
}
fout<<c<<" "<<s%9973<<'\n';
}
return 0;
}