Mai intai trebuie sa te autentifici.
Cod sursa(job #2365501)
Utilizator | Data | 4 martie 2019 14:09:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include "stdio.h"
int gcd(int a, int b)
{
while(a != b) {
a > b ? a -= b : b -= a;
}
}
int main()
{
int T;
int a, b;
FILE *inFile = fopen("euclid2.in", "r");
FILE *outFile = fopen("euclid2.out", "w");
fscanf(inFile, &T);
for(int i; i < T; i++) {
fscanf(inFile, "%d", &a);
fscanf(inFile, "%d", &b);
d = gcd(a, b);
fprintf(outFile, "%d\n", d);
}
fclose(inFile);
fclose(outFile);
return 0;
}