Cod sursa(job #538563)
Utilizator | Data | 21 februarie 2011 17:55:02 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream.h>
int i,n,x,y;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int divizor(int x,int y){
while(x!=y)if(x>y)x=x-y;else y=y-x;
return x;
}
int main(){f>>n;
for(i=1;i<=n;i++){f>>x>>y; g<<divizor(x,y)<<'\n';
}
g<<'\n';
g.close();
f.close();
return 0;}