Cod sursa(job #1846098)
| Utilizator | Data | 12 ianuarie 2017 10:35:03 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <cmath>
#include <bitset>
using namespace std;
ifstream in ("ssnd.in");
ofstream out ("ssnd.out");
void descompunere(long long n){
long long s = n + 1,nr = 2 ,i = 0 ,lim = sqrt(n);
for(i = 2 ; i <= lim ;i ++){
if(n % i == 0){
nr += 2;
s += (i + n / i);
}
}
out<<nr<<" "<<s<<'\n';
}
int main()
{
long long n ,a ,i;
in>>n;
for(i = 0 ; i< n ;i++){
in>>a;
descompunere(a);
}
return 0;
}
