Pagini recente » Cod sursa (job #2281209) | Cod sursa (job #2731234) | Cod sursa (job #1148209) | Cod sursa (job #2949515) | Cod sursa (job #2515266)
#include <fstream>
#define N 1000006
#define ll long long
#define M 9973
using namespace std;
ifstream in("ssnd.in");
ofstream out("ssnd.out");
ll p[N], v[N];
int main(){
ll t,n,i,j,k=0,s,d;
for(i=2; i<N; ++i){
if(!v[i]){
p[++k]=i;
for(j=2*i; j<N; j+=i)
v[j]=1;
}
}
in>>t;
while(t--){
in>>n;
j=s=d=1;
while(p[j] && p[j]<=n){
k=1;
i=p[j];
while(n%p[j]==0){
n/=p[j];
++k;
i*=p[j];
}
d*=k;
s=(s*((i-1)/(p[j]-1))%M)%M;
++j;
}
out<<d<<" "<<s<<"\n";
}
return 0;
}