Cod sursa(job #2474383)
| Utilizator | Data | 15 octombrie 2019 09:31:31 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
#include <iostream>
#include <cmath>
using namespace std;
long long sumdiv(long long n)
{
long long s=0,i;
for(i=1;i*i<=n;i++)
{
if(n%i==0)
{
s=s+i;
if(i*i<n)
s=s+n/i;
}
}
return s;
}
long long nrdiv(int n)
{
int i,cnt=0;
for(i=1;i*i<=n;i++)
{
if(n%i==0)
{
cnt++;
if(i*i<n)
cnt++;
}
}
return cnt;
}
int main()
{
long long n,i,x,y;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
f>>n;
for(i=0;i<n;i++)
{
f>>x;
g<<nrdiv(x)<<" "<<sumdiv(x)<<"\n";
}
return 0;
}
