Cod sursa(job #2378246)
Utilizator | Data | 11 martie 2019 21:34:19 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
int gcd (int a, int b)
{
while(b) b ^= a ^= b ^= a %= b;
return a;
}
int main(void)
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int T, A, B;
scanf("%d", &T);
for (; T; --T)
{
scanf("%d %d", &A, &B);
printf("%d\n", gcd(A, B));
}
return 0;
}