Pagini recente » Cod sursa (job #2886467) | Cod sursa (job #2959640) | Cod sursa (job #2862883) | Istoria paginii runda/oji_bv_1112 | Cod sursa (job #2332050)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
long long int n[1000],sum[1000];
int t,c[1000];
int main()
{
// ifstream cin("ssnd.in");
// ofstream cout("ssnd.out");
cin>>t;
for(int i=1;i<=t;i++)
{
cin>>n[i];
for(int j=1;j*j<n[i];j++)
{
if(n[i]%j==0)
{
c[i]+=2;
sum[i]=sum[i]+j+n[i]/j;
}
}
if((int)sqrt(n[i])==sqrt(n[i]))
{
c[i]++;
sum[i]+=sqrt(n[i]);
}
}
for(int i=1;i<=t;i++)
{
cout<<c[i]<<" "<<sum[i]<<endl;
}
}