Pagini recente » Cod sursa (job #1822632) | Cod sursa (job #2040018) | Cod sursa (job #2457128) | Cod sursa (job #271742) | Cod sursa (job #2032600)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int nullazo(int s,int p[0])
{
int i;
for(i=2;i<=s;i++){
p[i]=0;
}
}
int powe(int a,int b)
{
int k=1;
for(int i=0;i<b;i++)k=k*a;
return k;
}
int main()
{
int i,n,j,t[1000]={0},s,szama,p[1000]={0},osszeg;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
f>>n;
for(i=0;i<n;i++)f>>t[i];
for(i=0;i<n;i++){
szama=1;
osszeg=1;
s=sqrt(t[i]);
for(j=2;j<=s+1 && t[i]>1;){
if(t[i]%j==0){p[j]++;t[i]=t[i]/j;}
else j++;
}
for(j=2;j<=s+1;j++){
if(p[j]!=0){
szama=szama*(p[j]+1);
osszeg=osszeg*((powe(j,p[j]+1)-1)/(j-1));
}
}
if(t[i]>s)g<<2<<" ";
else g<<szama<<" ";
if(t[i]>s)g<<t[i]+1<<endl;
else g<<osszeg<<endl;
nullazo(s,p);
}
}