Cod sursa(job #1194664)
Utilizator | Data | 4 iunie 2014 15:37:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <stdio.h>
using namespace std;
FILE * in = fopen ("euclid2.in", "r");
FILE * out = fopen ("euclid2.out", "w");
int t, m, n;
int euclid(int m, int n)
{
if(n==0) return m;
return euclid(n, m%n);
}
int main()
{
fscanf(in, "%d", &t);
for(int i=0; i<t; i++)
{
fscanf(in, "%d %d", &m, &n);
fprintf(out, "%d\n", euclid(m,n));
}
return 0;
}