Cod sursa(job #3320262)
| Utilizator | Data | 4 noiembrie 2025 19:03:10 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | c-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <stdio.h>
#include <stdlib.h>
int gcd(int a, int b){
int r;
while(b){
r = a % b;
a = b;
b = r;
}
return a;
}
int main(){
FILE *input = fopen("euclid2.in", "r");
FILE *output = fopen("euclid2.out", "w");
int pairs;
fscanf(input, "%d", &pairs);
int a, b;
for(; pairs-- > 0;){
fscanf(input, "%d%d", &a, &b);
fprintf(output, "%d\n", gcd(a,b));
}
fclose(input);
fclose(output);
return 0;
}
