Cod sursa(job #2499046)
| Utilizator | Data | 25 noiembrie 2019 10:33:03 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <bits/stdc++.h>
FILE *in = fopen("euclid2.in", "r"), *out = fopen("euclid2.out", "w") ;
int main() {
long long a, b ;
int test ;
fscanf(in, "%d", &test) ;
for (int i = 1 ; i <= test ; ++ i) {
fscanf(in, "%d %d", &a, &b) ;
fprintf(out, "%d\n", std::__gcd(a, b)) ;
}
}
