Cod sursa(job #2153904)
Utilizator | Data | 6 martie 2018 16:00:19 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<cstdio>
using namespace std;
int gcd(int a,int b)
{
if(b)
return gcd(b,a%b);
return a;
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
int n,a,b;
scanf("%d",&n);
for(;n;n--)
{
scanf("%d%d",&a,&b);
printf("%d\n",gcd(a,b));
}
return 0;
}