Pagini recente » Cod sursa (job #1156513) | Cod sursa (job #335123) | Cod sursa (job #2182498) | Cod sursa (job #48379) | Cod sursa (job #1247934)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
#define Nmax 1000000
#define RAD 1000
#define Pmax 80000
#define MOD 9973
vector< bool > isPrime(Nmax);
int prim[Pmax], nrP;
//inline int putere(int, int) ;
int main()
{
int i, j, t;
long long a, sumDiv, nrDiv, p, nr, sum;
prim[0] = 2; nrP = 1;
for(i = 3; i < Nmax; i += 2)
{
while(isPrime[i] == 1 && i < Nmax) i += 2;
if(i < Nmax) prim[nrP++] = i;
if(i < RAD)
for(j = i * i; j < Nmax; j += (i << 1))
isPrime[j] = 1;
}
fin >> t;
for(; t; --t)
{
fin >> a;
sumDiv = nrDiv = 1;
for(i = 0; i < nrP && a >= 1LL * prim[i] * prim[i]; ++i)
{
if(a % prim[i]) continue;
sum = 1;
for(nr = 0, p = 1; a % prim[i] == 0; a /= prim[i], ++nr)
p *= prim[i],
sum += p;
//sumDiv *= putere(prim[i], nr + 1) - 1; sumDiv %= MOD;
//sumDiv *= putere(prim[i] - 1, MOD - 2); sumDiv %= MOD;
sumDiv *= sum; sumDiv %= MOD;
nrDiv *= nr + 1;
}
if(a != 1)
{
//a este nr prim
nrDiv *= 2;
sumDiv *= a + 1; sumDiv %= MOD;
}
fout << nrDiv << ' ' << sumDiv << '\n';
}
return 0;
}
/*
inline int putere(int baza, int exp)
{
int rez = 1;
baza %= MOD;
for(; exp; exp >>= 1)
{
if(exp & 1) rez = (rez * baza) % MOD;
baza = (baza * baza) % MOD;
}
return rez;
}
*/