Cod sursa(job #2261204)
Utilizator | Data | 16 octombrie 2018 06:59:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
int gcd(int a, int b) {
if(!b) return a;
return gcd(b , a % b);
}
int main () {
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int test;
scanf("%d", &test);
while(test--) {
int a , b;
scanf("%d %d", &a , &b);
printf("%d\n", gcd(a , b));
}
}