Cod sursa(job #2966174)
| Utilizator | Data | 16 ianuarie 2023 20:11:27 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
const int mod = 9973;
int n, i, a, s, nr, d;
int main() {
fin >> n;
for(i = 1; i <= n; i++) {
fin >> a;
d = 2;
nr = s = 1;
while(d * d <= a) {
if(a % d == 0) {
s = ((s % mod) + (d % mod)) % mod;
nr++;
}
while(a % d == 0) a /= d;
d++;
}
if(a > 1) {
s = ((s % mod) + (a % mod)) % mod;
nr++;
}
fout << nr << " " << s << "\n";
}
return 0;
}
