Cod sursa(job #146002)
Utilizator | Data | 1 martie 2008 00:11:41 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <stdio.h>
int gcd(int a, int b) {
if (!b) return a;
return gcd(b, a % b);
}
int main(void) {
int a, b;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d %d", &a, &b);
printf("%d\n", gcd(a, b));
return 0;
}