Pagini recente » Cod sursa (job #2338742) | Cod sursa (job #1319861) | Cod sursa (job #10129) | Cod sursa (job #3199582) | Cod sursa (job #870648)
Cod sursa(job #870648)
#include <iostream>
#include <fstream>
using namespace std;
int divizor (int x, int y) {
int r;
while (y){
r=x%y;
x=y;
y=r;
}
return x;
}
int main(){
int n, y, x, s, v[99999], i;
//ifstream f("sum.in");
//ofstream g("sum.out");
cin>>n;
for (i=0; i<=n-1; i++){
cin>>v[i];
}
for (i=0; i<=n-1; i++){
x=v[i];
s=0;
for (y=1; y<=2*x; y++){
if ((divizor(x,y))==1) s=s+y;
}
cout<<s<<endl;
}
//g.close();
//f.close();
return 0;
}