Cod sursa(job #1204317)
Utilizator | Alexandru Gheorghe Ivanus ivanusAG | Data | 2 iulie 2014 17:06:46 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <stdio.h>
typedef unsigned long ulong;
using namespace std;
ulong cmmdc( ulong a, ulong b)
{
if (!b)
return a;
else
return cmmdc(b, a%b);
}
int main()
{
ulong t,a,b,c,i;
FILE *fin, *fout;
fin = fopen("euclid2.in", "r");
fout = fopen("euclid2.out", "w");
fscanf(fin,"%lu",&t);
for (i=0;i<t;i++)
{
fscanf(fin,"%lu %lu", &a, &b);
fprintf(fout,"%lu\n", cmmdc(a,b));
}
fclose(fin);
fclose(fout);
return 0;
}