Cod sursa(job #1914695)
Utilizator | Data | 8 martie 2017 18:08:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#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()
{
int i, t, x, y;
cin >> t;
for (i = 0; i < t; i++)
{
cin >> x >> y;
cout << gcd(x, y) << '\n';
}
return 0;
}