Cod sursa(job #3251425)
Utilizator | Data | 25 octombrie 2024 23:40:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int n;
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
int main()
{
int x, y;
fin >> n;
for (int i = 1; i <= n; i++)
{
fin >> x >> y;
fout << gcd(x, y) << '\n';
}
return 0;
}