Cod sursa(job #2271759)
| Utilizator | Data | 29 octombrie 2018 10:44:19 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin ("ssnd.in");
ofstream fout ("ssnd.out");
int t, s, n, k, nr, j;
int main() {
fin >> t;
while (t--) {
fin >> n;
s = sqrt(n);
nr = k = 0;
for (int i = 1; i <= s; ++i) {
if (n % i == 0) {
++nr;
k += i;
}
j = n / i;
if (n % j == 0) {
++nr;
k += j;
}
}
if (s * s == n) {
--nr;
k -= s;
}
fout << nr << ' ' << k << '\n';
}
}
