Cod sursa(job #3142729)
Utilizator | Data | 23 iulie 2023 20:05:42 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
int main(){
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int t;
int x, y;
in >> t;
while(t--){
in >> x >> y;
int d = max(x, y) % min(x, y);
d == 0 ? out << min(x, y) << "\n" : out << d << "\n";
}
in.close();
out.close();
}