Pagini recente » Cod sursa (job #274860) | Monitorul de evaluare | Cod sursa (job #1491229) | Cod sursa (job #667117) | Cod sursa (job #1289837)
#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
using namespace std;
int t, a, b;
int gcd(int a, int b)
{
int r;
while(b)
{
r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &t);
for(; t; t--)
{
scanf("%d%d", &a, &b);
printf("%d\n", gcd(a, b));
}
return 0;
}