Cod sursa(job #1621332)
| Utilizator | Data | 29 februarie 2016 18:25:28 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <stdio.h>
#include <algorithm>
using namespace std;
#define ll long long unsigned
#define pb push_back
#define mp make_pair
int gcd(int a, int b){
int t;
while(b){
t = a%b;
a = b;
b = t;
}
return a;
}
int main(){
int n,i,a,b;
freopen("maxk.in", "r", stdin);
freopen("maxk.out", "w", stdout);
scanf("%d",&n);
for(i = 1;i <= n;i++){
scanf("%d %d",&a,&b);
printf("%d\n",gcd(a, b));
}
return 0;
}
