Cod sursa(job #2602685)
Utilizator | Data | 17 aprilie 2020 17:05:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <cstdio>
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
freopen ("euclid2.in", "r", stdin);
freopen ("euclid2.out", "w", stdout);
int t;
scanf("%d", &t);
for (int tc = 1; tc <= t; tc++) {
int a, b;
scanf("%d %d", &a, &b);
printf("%d\n", 1);
}
}