Pagini recente » Cod sursa (job #421039) | Cod sursa (job #2121363) | Cod sursa (job #2872424) | Cod sursa (job #2512415) | Cod sursa (job #2509141)
#include <stdio.h>
#define MOD 9973
#define MAX 1000000
char ciur[MAX + 1];
int p[MAX / 10];
int main() {
FILE *fin = fopen( "ssnd.in", "r" );
FILE *fout = fopen( "ssnd.out", "w" );
int q, i, exp, k, d, maxk;
long long S, pow, nrd, n;
k = 0;
for ( d = 2; d <= MAX; ++d ) {
if ( ciur[d] == 0 ) {
p[k] = d;
++k;
for ( i = d + d; i <= MAX; i += d ) {
ciur[i] = 1;
}
}
}
maxk = k;
fscanf( fin, "%d", &q );
for ( i = 0; i < q; ++i ) {
fscanf( fin, "%lld", &n );
nrd = 1;
S = 1;
k = 0;
exp = 0;
while ( p[k] * p[k] <= n && maxk > k ) {
pow = 1;
exp = 0;
while ( n % p[k] == 0 ) {
pow *= p[k];
++exp;
n /= p[k];
}
S = (S * ((pow * p[k] - 1) / (p[k] - 1))) % MOD;
nrd *= (exp + 1);
++k;
}
if ( n > 1 ) {
nrd *= 2;
S = (S * ((n * n - 1) / (n - 1))) % MOD;
}
fprintf( fout, "%lld %lld\n", nrd, S );
}
fclose( fin );
fclose( fout );
return 0;
}