Pagini recente » Cod sursa (job #2793230) | Cod sursa (job #2793240) | Diferente pentru problema/inversmodular intre reviziile 13 si 14 | Cod sursa (job #142419) | Cod sursa (job #1738431)
#include <stdio.h>
int euclid2(int a, int b)
{
int r = 0;
while (b > 0)
{
r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
freopen ("euclid2.in", "r", stdin);
freopen ("euclid2.out", "w", stdout);
int n, a, b;
scanf("%d", &n);
for (int i = 0; i < n; ++i)
{
scanf("%d %d", &a, &b);
printf("%d\n", euclid2(a, b));
}
return 0;
}