Cod sursa(job #2162850)
Utilizator | Data | 12 martie 2018 15:05:00 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,x,y;
int euclid(int a, int b){
int r;
while(b>0){
r=a%b;
a=b;
b=r;
}
return a;
}
int main(){
f>>n;
for(int i=1; i<=n; ++i){
f>>x>>y;
g<<euclid(x,y)<<'\n';
}
return 0;
}