Cod sursa(job #2332045)
| Utilizator | Data | 30 ianuarie 2019 12:34:51 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
long long int n[1000];
int t,c=0,sum=0;
int main()
{
ifstream cin("ssnd.in");
ofstream cout("ssnd.out");
cin>>t;
for(int i=1;i<=t;i++)
{
sum=0;
c=0;
cin>>n[i];
for(int j=1;j*j<n[i];j++)
{
if(n[i]%j==0)
{
c+=2;
sum=sum+j+n[i]/j;
}
}
if((int)sqrt(n[i])==sqrt(n[i]))
{
c++;
sum+=sqrt(n[i]);
}
cout<<c<<" "<<sum<<endl;
}
}
