Cod sursa(job #1644759)
| Utilizator | Data | 10 martie 2016 09:15:14 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int nr, k, s=0, x, i;
int nrdiv(int k)
{
int i, nr=1;
if(k==1)
return 1;
else
{
for(i=1;i<=k/2;i++)
if(k%i==0)
{
nr=nr+1;
}
}
return nr;
}
int sumdiv (int k)
{
int i, s=1;
if(k==1)
return 1;
else
{
for(i=1;i<=k/2;i++)
if(k%i==0)
s=s+k/i;
}
return s;
}
int main()
{
f>>k;
for(i=1;i<=k;i++)
{
f>>x;
g<<nrdiv(x)<<" "<<sumdiv(x)<<"\n";
}
return 0;
}
