Cod sursa(job #3000422)
Utilizator | Data | 12 martie 2023 13:59:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a, int b)
{
if(b > a)
{
swap(a, b);
}
int r = a % b;
while(r)
{
a = b;
b = r;
r = a % b;
}
return b;
}
int main()
{
int T;
fin >> T;
for(int i = 0; i < T; i++)
{
int a, b;
fin >> a >> b;
fout << gcd(a, b) << endl;
}
return 0;
}