Cod sursa(job #2612888)
| Utilizator | Data | 9 mai 2020 13:38:56 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <cstdio>
#include <cmath>
using namespace std;
const int MOD = 9973;
int main() {
freopen("ssnd.in", "r", stdin);
freopen("ssnd.out", "w", stdout);
int t;
int n;
scanf("%d", &t);
while (t --) {
scanf("%d", &n);
long long suma = 0;
int numarDiv = 0;
int i;
for (i = 1;i * i < n;i ++) {
if (n % i == 0) {
suma = (suma + i) % MOD;
suma = (suma + n / i) % MOD;
numarDiv += 2;
}
}
if (i * i == n) {
suma = (suma + i) % MOD;
numarDiv ++;
}
printf("%d %d\n", numarDiv, suma);
}
return 0;
}