Cod sursa(job #2779506)
| Utilizator | Data | 3 octombrie 2021 23:14:58 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssnd.in");
ofstream out("ssnd.out");
long long int z, d, sum, x, nr;
int divNrSum(int n)
{
sum = nr = 0;
for(d = 1; d * d <= n; d++)
{
if(n % d == 0)
{
sum += d, nr ++;
if(d * d < n)
sum += n / d, nr ++;
}
}
out<<nr<<" "<<sum<<endl;
return 0;
}
int main()
{
long long int v[1001];
in >> z;
for(int i = 1; i<=z; i++)
in >> v[i];
for(int i = 1; i<=z; i++)
divNrSum(v[i]);
return 0;
}
