Cod sursa(job #3261447)
| Utilizator | Data | 5 decembrie 2024 21:38:32 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | c-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <stdio.h>
int main() {
FILE *intrare = fopen("euclid2.in", "r");
FILE *iesire = fopen("euclid2.out", "w");
if(intrare == NULL || iesire == NULL) {
return 1;
}
int x ,n1, n2, r;
fscanf(intrare, "%d", &x);
for(int i = 1; i <= x; i++) {
fscanf(intrare, "%d %d", &n1, &n2);
while(n2 != 0) {
r = n1 % n2;
n1 = n2;
n2 = r;
}
fprintf(iesire, "%d\n", n1);
}
fclose(intrare);
fclose(iesire);
return 0;
}