Cod sursa(job #3312285)
| Utilizator | Data | 27 septembrie 2025 12:47:17 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
long long cmmdc(long long a, long long b)
{
long long r;
while (b != 0)
{
r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
long long a, b,n;
in >> n;
while (n--)
{
in >> a >> b;
out << cmmdc(a, b) << endl;
}
}