Cod sursa(job #1792341)
| Utilizator | Data | 30 octombrie 2016 12:48:38 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
long suma = 0;
int nr = 0;
int sumd( int n, int d )
{
if(d * d > n)
return 0;
if(n % d == 0)
{
suma += 1LL * (d + n / d);
nr += 2;
}
d++;
sumd(n , d);
return suma;
}
int main()
{
ifstream fin ("ssnd.in");
ofstream fout ("ssnd.out");
int n;
fin >> n;
while (fin >> n)
{
suma = 0;
nr = 0;
int z = sumd(n , 1);
fout << nr <<" "<< z <<'\n';
}
fin.close();
fout.close();
return 0;
}
