Cod sursa(job #2640742)
Utilizator | Data | 7 august 2020 20:35:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc(int a, int b) {
if(b < a)
swap(b, a);
while(a != 0) {
int rest = b % a;
b = a;
a = rest;
}
return b;
}
int main() {
int n;
fin >> n;
for (int i = 1; i <= n; ++i) {
int a, b;
fin >> a >> b;
fout << cmmdc(a, b) << "\n";
}
}