Cod sursa(job #826684)
Utilizator | Data | 1 decembrie 2012 04:14:37 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <stdio.h>
int a , b , n , i;
FILE f,g;
f=fopen("euclid2.in" ,"r");
g=fopen("euclid2.out" ,"w") ;
int cmmdc (int a , int b)
{
if(!b)
return a;
return cmmdc(b,a%b);
}
int main()
{
fscanf(f,"%d",&n);
for(i=1,i<=n,i++)
{
fscanf(f,"%d",&a);
fscanf(f,"%d",&b);
fprintf(g,"%d\n",cmmdc(a,b));
}
return 0;
}