Pagini recente » Cod sursa (job #2251065) | Cod sursa (job #2618778) | Cod sursa (job #2528655) | Cod sursa (job #2236326) | Cod sursa (job #763197)
Cod sursa(job #763197)
//1. Algoritmul lui Euclid cmmdc
#include <stdio.h>
#include <stdlib.h>
long cmmdc(long a, long b)
{
if(a==b) return a;
if(a>b) return cmmdc(a-b, b);
else return cmmdc(a,b-a);
}
int main()
{
FILE *fin, *fout;
long i, T, a, b;
fin=fopen("euclid2.in", "r");
fout=fopen("euclid2.out", "w");
if(fin==0) return;
fscanf(fin, "%ld", &T);
for(i=1;i<=T;i++)
{
fscanf(fin,"%ld %ld", &a, &b);
fprintf(fout, "%ld\n", cmmdc(a,b));
}
fclose(fin);
fclose(fout);
return 0;
}