Cod sursa(job #866082)
| Utilizator | Data | 27 ianuarie 2013 15:23:49 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <stdio.h>
int main () {
int n, i, a, b;
FILE *in,*out;
in = fopen("euclid2.in", "rt");
out = fopen("euclid2.out", "w+");
fscanf (in, "%d", &n);
for (i = 0; i < n; i++) {
fscanf (in, "%d %d", &a, &b);
while (a != b)
{
if (a > b)
{
b = a-b;
}
else
{
b = b-a;
}
}
fprintf(out,"%d\n", b);
}
fclose(in);
fclose(out);
return 0;
}
