Cod sursa(job #2418410)
Utilizator | David Darius Dvd_Drs | Data | 4 mai 2019 21:31:04 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int T,a,b;
int euclid(int x, int y){
while (y!=0) {
int r = x % y;
x = y;
y = r;
}
return x;
}
int main() {
in>>T;
for(int i = 0; i < T; ++i){
in>>a>>b;
out<<euclid(a,b)<<'\n';
}
return 0;
}