Cod sursa(job #2705369)
Utilizator | Data | 12 februarie 2021 14:54:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a, int b)
{
int r;
while(b!=0)
{
r = a%b;
a = b;
b = r;
}
return a;
}
int main()
{
int n, x ,y;
fin >> n;
for(int i = 1; i <= n; i++)
{
fin >> x >> y;
fout << gcd(x, y) << "\n";
}
return 0;
}