Cod sursa(job #1657353)
Utilizator | Data | 20 martie 2016 13:42:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
#include<assert.h>
inline int gcd(int a, int b)
{
int r;
while (b != 0)
{
r = a%b;
a = b;
b = r;
}
return a;
}
int main()
{
int T, a, b;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
for (scanf("%d", &T), assert(T <= 100000); T; --T)
{
scanf("%d%d", &a, &b);
printf("%d\n", gcd(a, b));
}
return 0;
}