Cod sursa(job #2956635)
| Utilizator | Data | 19 decembrie 2022 22:48:49 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("ssnd.in");
ofstream cout("ssnd.out");
long long int v[1000];
int sum_div(int n){
int sumdiv = 0;
for(int d = 1; d <= n; d++) {
if(n % d == 0) {
sumdiv = sumdiv + d;
}
}
return sumdiv;
}
int main(){
int n;
cin >> n;
for(int i = 0; i < n; i++){
cin >> v[i];
if(v[i]%2 == 0){
cout << v[i]/2 << " ";
}else{
cout << 2 << " ";
}
cout << sum_div(v[i]) << endl;
}
return 0;
}