Cod sursa(job #2642034)
Utilizator | Data | 13 august 2020 15:00:53 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
//#include <iostream>
#include <fstream>
using namespace std;
ifstream cin ("euclid2.in");
ofstream cout ("euclid2.out");
int gcd(int a, int b) {
if (b==0)
return a;
return gcd(b, a%b);
}
int main() {
setbuf(stdout,NULL);
int a, b, n;
cin >> n;
while (n)
{
cin >> a >> b;
cout << gcd(a, b) << endl;
n--;
}
return 0;
}