Cod sursa(job #148947)
| Utilizator |  Andrei Homorodean peanutz |
Data | 5 martie 2008 01:12:21 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.27 kb |
#include <stdio.h>
long a, b;
long gcd(long a, long b)
{
if(!b) return a;
return gcd(b, a%b);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%ld %ld", &a, &b);
printf("%ld\n", gcd(a, b));
return 0;
}