Cod sursa(job #2006922)
Utilizator | Teodor Anitoaei Zeno | Data | 1 august 2017 13:18:53 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
#define NMAX 110
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n, a, b;
int Euclid(int a, int b) {
if(b == 0) return a;
else return Euclid(b, a % b);
}
int main()
{
fin >> n;
while(n--) {
fin >> a >> b;
fout << Euclid(a, b) << '\n';
}
return 0;
}