Cod sursa(job #1593906)
Utilizator | Data | 8 februarie 2016 23:25:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdio.h>
int T, A, B;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main(void)
{
FILE*fin=fopen("euclid2.in","r");
FILE*fout=fopen("euclid2.out","w");
fscanf(fin,"%d", &T);
for (; T; --T)
{
fscanf(fin,"%d %d", &A, &B);
fprintf(fout,"%d\n", gcd(A, B));
}
return 0;
}