Cod sursa(job #3340972)
| Utilizator | Data | 17 februarie 2026 14:55:46 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
string name = "euclid2";
ifstream f(name + ".in");
ofstream g(name + ".out");
long long cmmdc(int a, int b)
{
int r;
while (b)
{
r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
long long int n, a, b;
f >> n;
for (int i = 1; i <= n; i++)
{
f >> a >> b;
g << cmmdc(a, b);
}
return 0;
}