Cod sursa(job #3326524)
| Utilizator | Data | 29 noiembrie 2025 12:27:27 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int gcd(int a, int b) {
if (!b)
return a;
return gcd(b, a % b);
}
void solve() {
int a, b;
f >> a >> b;
g << gcd(a, b);
}
int main() {
int cases;
f >> cases;
while (cases--) {
solve();
g << "\n";
}
}
