Cod sursa(job #502799)
| Utilizator | Data | 20 noiembrie 2010 14:41:58 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <stdio.h>
#include <stdlib.h>
int euclid(int &x, int &y) {
if(x < y) {
int swap = x;
x = y;
y = swap;
}
while(y != 0) {
x = x % y;
int swap = x;
x = y;
y = swap;
}
return x;
}
int main() {
int cases;
FILE* input = fopen("euclid2.in", "r");
FILE* output = fopen("euclid2.out", "w");
fscanf(input, "%d", &cases);
int a, b, result;
while(cases--) {
fscanf(input, "%d%d", &a, &b);
result = euclid(a, b);
fprintf(output, "%d\n", result);
}
}
