Cod sursa(job #2430389)
Utilizator | Data | 14 iunie 2019 15:53:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <bits/stdc++.h> //JuniorMonster a.k.a Sho10
#define ll long long
using namespace std;
int n,a,b;
int32_t main(){
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
cin>>n;
for(ll i=0;i<n;i++)
{
scanf("%d %d",&a,b);
printf("%d\n", __gcd(a,b));
}
return 0;}