Pagini recente » algoritmiada-2019/runda-preoji/solutii/tablou | Statistici Coroian Sebastian (escapeMCro) | Rating blaugranadevil (lucian2015) | Cod sursa (job #2018846) | Cod sursa (job #1296945)
#include <stdio.h>
int cmmdc(int a, int b)
{
if (a==0)
return b;
if (b==0)
return a;
if(a==b)
return a;
if(a<b)
{
b=b%a;
return cmmdc(a,b);
}
else
{
a=a%b;
return cmmdc(a,b);
}
}
int main()
{
FILE *in, *out;
in = fopen("euclid2.in", "r");
out = fopen("euclid2.out", "w");
int tests;
fscanf(in, "%d", &tests);
for (int i = 1; i <= tests; i++) {
int a, b;
fscanf(in, "%d %d", &a, &b);
fprintf(out, "%d\n", cmmdc(a, b));
}
fclose(in);
fclose(out);
return 0;
}