Pagini recente » Cod sursa (job #2625305) | Borderou de evaluare (job #1711165) | Cod sursa (job #1033493) | Cod sursa (job #1959496) | Cod sursa (job #1823750)
#include <stdio.h>
#include <string.h>
#define MOD 9973
long long expo(long long a, long long b){
long long result = 1;
while (b){
if (b&1){
result = (result * a);
}
b >>= 1;
a = (a * a);
}
return result;
}
int main(){
FILE *file1, *file2;
int T, M, N, i, Sum, nDiv, power;
file1 = fopen("ssnd.in", "r");
file2 = fopen("ssnd.out", "w");
fscanf(file1, "%d", &T);
while(T--){
nDiv = 1;
Sum = 1;
fscanf(file1, "%d", &N);
M = N;
for(i=2; i*i<=N; i++){
power = 0;
if(!(M%i)){
while(M && M%i==0){
M /= i;
power++;
}
nDiv *= (power + 1);
Sum = (Sum%MOD * ((expo(i, power+1) - 1) / (i - 1))%MOD) % MOD;
}
if(M==1){
break;
}
}
if(nDiv==1 && Sum==1 && N!=1){
nDiv = 2;
Sum += N;
}
fprintf(file2, "%d %d\n", nDiv, Sum);
}
return 0;
}