Cod sursa(job #2711385)
Utilizator | Ioana Draganescu IoanaDraganescu | Data | 24 februarie 2021 02:22:27 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
const int TMax = 1e5;
int t, a, b;
int CMMDC(int a, int b){
while (a && b){
if (a > b)
a = a % b;
else
b = b % a;
}
return max(a, b);
}
int main(){
fin >> t;
for (int i = 1; i <= t; i++){
fin >> a >> b;
fout << CMMDC(a, b) << '\n';
}
return 0;
}