Cod sursa(job #476239)
Utilizator | Data | 10 august 2010 12:47:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
int gcd(int a, int b)
{
int tmp;
while (b)
{
tmp = a % b;
a = b;
b = tmp;
}
return a;
}
int main()
{
FILE *f, *g;
int t, a, b, i;
g = fopen("euclid2.out", "w");
f = fopen("euclid2.in", "r");
fscanf(f, "%d", &t);
for (i = 0; i < t; i++)
{
fscanf(f, "%d", &a);
fscanf(f, "%d", &b);
fprintf(g, "%d\n", gcd(a, b));
}
fclose(f);
fclose(g);
return 0;
}