Cod sursa(job #1765808)
| Utilizator | Data | 27 septembrie 2016 00:00:58 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream in("ssnd.in");
ofstream out("ssnd.out");
void fct(int a)
{int i,nr,s;
nr=0;
s=0;
for(i=1;i<=a;i++)
if(a%i==0)
{
nr=nr+1;
s=s+i;
}
out<<nr<<" "<<s%9973<<endl;
}
int main()
{
int n,v[1000],i;
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
for(i=1;i<=n;i++)
fct(v[i]);
in.close();out.close();
return 0;}
