Cod sursa(job #2842212)
Utilizator | Data | 31 ianuarie 2022 12:34:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <stdio.h>
int gcd(int a,int b)
{
if(!b)
return a;
return gcd(b,a%b);
}
int main()
{ int T,a,b;
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));}
}