Pagini recente » Cod sursa (job #1510007) | Cod sursa (job #871004) | Cod sursa (job #1413259) | Cod sursa (job #2457612) | Cod sursa (job #2423340)
#include <fstream>
#define MOD 9973
using namespace std;
long long i, n, x, d, nrdiv, sumdiv, val, fm;
long long lgput(long long n, long long p)
{
long long r = 1;
while(p)
{
if(p % 2 == 1) r = r * n;
n = n * n;
p /= 2;
}
return r;
}
int main()
{
ifstream f("ssnd.in");
ofstream g("ssnd.out");
f >> n;
while(n --)
{
f >> x;
d = 2;
nrdiv = sumdiv = 1;
do
{
fm = 0;
while(x % d == 0)
{
x = x / d;
fm ++;
}
if(fm > 0)
{
nrdiv = nrdiv * (fm + 1);
val = lgput(d, fm + 1);
sumdiv = (sumdiv * (val - 1) / (d - 1) ) % MOD;
}
d ++;
if(d * d > x && x > 1)
{
nrdiv = nrdiv * 2;
sumdiv = (sumdiv * (x * x - 1) / (x - 1)) % MOD;
x = 1;
}
}
while(x > 1);
g << nrdiv << " " << sumdiv << "\n";
}
return 0;
}