Cod sursa(job #144378)
Utilizator | Tabara Mihai Tabara | Data | 27 februarie 2008 15:32:41 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <stdio.h>
#define in "euclid2.in"
#define out "euclid2.out"
int GCD(int a,int b) { if ( !b ) return a; return GCD(b, a%b); }
int X, Y;
int main()
{
freopen( in, "r", stdin );
freopen( out, "w", stdout );
scanf( "%d%d", &X, &Y );
printf( "%d\n", GCD(X,Y) );
return 0;
}