Pagini recente » Cod sursa (job #1930779) | Cod sursa (job #2781666) | Cod sursa (job #2273604) | Cod sursa (job #1683650) | Cod sursa (job #1348831)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
long long putere(long d,long p)
{
long long prod=1;
for(int i=1;i<=p;i++)
prod=prod*d;
return prod;
}
int main()
{
long long n,d=2,p=0,nr=1,s=1,x;
fin>>n;
for(int i=1;i<=n;i++)
{fin>>x;nr=1;s=1;
d=2;
while(x>1)
{
p=0;
while(x%d==0)
{
x=x/d;
p++;
}
if(p) {
nr=nr*(p+1);
s=s*((putere(d,p+1)-1))/(d-1)%9973;
}
d++;
}
fout<<nr<<" "<<s<<"\n";
}
return 0;
}