Pagini recente » Cod sursa (job #2967628) | Cod sursa (job #2100498) | Cod sursa (job #1676079) | Cod sursa (job #1849168) | Cod sursa (job #2612872)
#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);
int suma = 0;
int numarDiv = 0;
for (int i = 1;i * i <= n;i ++) {
if (n % i == 0) {
suma = (suma + i) % MOD;
suma = (suma + n / i) % MOD;
numarDiv += 2;
}
}
int SQRT = sqrt(n);
if (sqrt(n) == SQRT) {
numarDiv -= 1;
suma -= SQRT;
}
printf("%d %d\n", numarDiv, suma);
}
return 0;
}