Cod sursa(job #3362494)
| Utilizator | Data | 9 august 2026 22:19:50 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("euclid2.in");
ofstream out ("euclid2.out");
int n, a, b;
long long calc(long long a,long long b)
{
while (b > 0)
{
long long r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
in >> n;
for (int i = 0; i < n; i++)
{
in >> a >> b;
out << calc(a, b) << "\n";
}
return 0;
}
