Pagini recente » Cod sursa (job #626603) | Cod sursa (job #3144165) | Cod sursa (job #360773) | Cod sursa (job #1571022) | Cod sursa (job #2515283)
#include <fstream>
#define N 1000006
#define ll long long
#define M 9973
using namespace std;
ifstream in("ssnd.in");
ofstream out("ssnd.out");
int p[N/2];
bool v[N];
int main(){
int t,n,i,k=0,d;
ll s,j;
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;
i=s=d=1;
while(p[i] && p[i]*p[i]<=n){
k=1;
j=p[i];
while(n%p[i]==0){
n/=p[i];
++k;
j*=p[i];
}
d*=k;
s=(s*((ll)(j-1)/(p[i]-1))%M)%M;
++i;
}
if(n!=1) d*=2, s=(s*((ll)(n+1)))%M;
out<<d<<" "<<s<<"\n";
}
return 0;
}