Cod sursa(job #2332050)
| Utilizator | Data | 30 ianuarie 2019 12:39:41 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#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;
}
}
