Cod sursa(job #2606070)
| Utilizator | Data | 26 aprilie 2020 21:14:05 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main(){
long long T , a , b ;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f >> T;
for ( int i = 0; i < T; i++){
f >> a >> b;
while ( a != b){
if (a > b )
a = a - b;
if (b > a)
b = b - a;
}
g << a << "\n";
}
f.close();
g.close();
return 0;
}
