Cod sursa(job #3359911)
| Utilizator | Data | 6 iulie 2026 13:51:52 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.96 kb |
#include <fstream>
using namespace std;
ifstream cin("ssnd.in");
ofstream cout("ssnd.out");
bool e[1000005];
int p[1000005];
int k=0;
void ciur(){
e[0]=e[1]=1;
for(int i=2;i<=1000000;i++){
if(e[i]==0){
p[++k]=i;
for(int j=i;j<=1000000;j+=i){
e[j]=1;
}
}
}
}
int main()
{
ciur();
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int d=1;
int nr=1;
int sum=1;
while(n>1){
int e=0;
int pw=p[d];
while(n%p[d]==0){
n/=p[d];
e++;
pw*=p[d];
}
nr*=(e+1);
sum*=(pw-1)/(p[d]-1);
d++;
if(p[d]*p[d]>n&&n>1){
nr*=2;
sum*=(n*n-1)/(n-1);
n=1;
}
}
cout<<nr<<" "<<sum<<'\n';
}
return 0;
}
