Cod sursa(job #1253227)
| Utilizator | Data | 31 octombrie 2014 22:37:04 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
// Educational 01: Euclid
#include <stdio.h>
#define MAX(a,b) (a > b ? a : b)
#define MIN(a,b) (a < b ? a : b)
long int euclid(long int a, long int b) {
long int x;
while(b != 0) {
a %= b;
x = a; a = b; b = x;
}
return a;
}
int main() {
long int n, i, a, b, x;
FILE *in = fopen("euclid2.in", "r");
FILE *out = fopen("euclid2.out", "w");
fscanf(in, "%ld", &n);
for(i=0; i<n; i++) {
fscanf(in, "%ld %ld", &a, &b);
fprintf(out, "%ld\n", euclid(a, b));
}
fclose(out);
}
