Cod sursa(job #3298186)
Utilizator | Data | 27 mai 2025 21:12:49 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int gcd(int a, int b) {
return b == 0? a : gcd(b, a%b);
}
int main() {
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n;
int n1, n2;
f>> n;
for (int i = 0; i < n; i++)
{
f>> n1>> n2;
if (n1 > n2) {
int aux = n1;
n1 = n2;
n2 = aux;
}
g<< gcd(n1, n2) << "\n";
}
return 0;
}