Cod sursa(job #1248060)
Utilizator | Data | 24 octombrie 2014 16:03:10 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdio.h>
using namespace std;
int cmmdc(int a, int b)
{
if (b == 0)
return a;
else return cmmdc(b, a % b);
}
int main()
{
FILE *in = fopen("euclid2.in", "r"),
*out = fopen("euclid2.out", "w");
int a, b, n;
fscanf(in, "%d", &n);
for (int i = 0; i < n; i++){
fscanf(in, "%d %d", &a, &b);
fprintf(out, "%d\n", cmmdc(a, b));
}
return 0;
}