Cod sursa(job #1261183)
| Utilizator | Data | 12 noiembrie 2014 00:31:46 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
int gcd (int a , int b) {
if (b != 0) {
return gcd(b, a % b);
}
return a;
}
int main()
{
int n = 0, i = 0, a = 0, b = 0;
FILE * in_file = fopen("euclid2.in", "r");
FILE * out_file = fopen("euclid2.out", "w");
fscanf(in_file, "%d", &n);
for (i = 0; i < n ; i ++) {
fscanf(in_file, "%d", &a);
fscanf(in_file, "%d", &b);
fprintf(out_file, "%d\n", gcd(a, b));
}
fclose(in_file);
fclose(out_file);
return 0;
}
