Cod sursa(job #2556643)
Utilizator | Data | 25 februarie 2020 08:51:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <stdio.h>
#include <stdlib.h>
int gcd(int a, int b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
int main()
{
//printf("%d", gcd(24, 18));
FILE *fin=fopen("euclid.in", "r");
FILE *fout=fopen("euclid.out", "w");
int t;
fscanf(fin, "%d", &t);
for (int i=1; i<=t; i++)
{
int a; int b;
fscanf(fin, "%d %d\n", &a, &b);
int res=gcd(a, b);
fprintf(fout, "%d\n", res);
}
return 0;
}