Cod sursa(job #2185327)
Utilizator | Data | 24 martie 2018 14:44:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <stdio.h>
int main() {
FILE *fin, *fout;
fout = fopen("euclid2.out","w+");
fin = fopen("euclid2.in", "r+");
long t, a, b;
fscanf (fin, "%li", &t);
for ( ;t > 0; t--) {
fscanf (fin, "%li", &a);
fscanf (fin, "%li", &b);
long aux;
if ( a < b){
aux = a;
a = b;
b = aux;
}
while ( a != b) {
a = a/b;
aux = b;
b = a;
a = aux;
}
fprintf(fout, "%li", a);
}
fclose(fout);
fclose(fin);
}