Cod sursa(job #3308984)
| Utilizator | Data | 30 august 2025 17:48:56 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ifstream fin("a.in");
ofstream fout("a.out");
int cmmdc(int a, int b)
{
while (b != 0)
{
int r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
int n;
fin >> n;
while (n != 0)
{
int a, b;
fin >> a >> b;
fout << cmmdc(a, b) << '\n';
n--;
}
}