Cod sursa(job #870643)
Utilizator | Data | 3 februarie 2013 19:29:56 | |
---|---|---|---|
Problema | Sum | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#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");
f>>n;
for (i=0; i<=n-1; i++){
f>>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+(divizor(x,y));
}
g<<s<<"/n";
}
g.close();
f.close();
return 0;
}