Cod sursa(job #2846032)
Utilizator | Focsa Ionut-Madalin Madalin_Ionut | Data | 8 februarie 2022 17:51:51 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n;
int Cmmdc(int a, int b)
{
int r;
while (b != 0)
{
r = a % b;
a = b;
b = r;
}
return a;
}
void Citire()
{
int i, a, b;
fin >> n;
for (i = 1; i <= n; i++)
{
fin >> a >> b;
fout << Cmmdc(a, b) << "\n";
}
}
int main()
{
Citire();
}