Pagini recente » Cod sursa (job #2228467) | Monitorul de evaluare | Cod sursa (job #3346847) | Borderou de evaluare (job #1588855) | Cod sursa (job #1491604)
#include <stdio.h>
long gcd(long a, long b)
{
while (a != b)
{
if (a > b && a - b > 0)
a = a - b;
else b = b - a;
}
return a;
}
int main()
{
FILE *input = fopen("euclid2.in", "r");
FILE *output = fopen("euclid2.out", "w");
long T;
long a, b;
// scan number of pairs
fscanf(input, "%ld", &T);
// deal with them
for (long i = 0; i < T; i++)
{
fscanf(input, "%ld %ld", &a, &b);
fprintf(output, "%ld", gcd(a, b));
}
return 0;
}