Cod sursa(job #151163)
Utilizator | Data | 7 martie 2008 21:04:12 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <stdio.h>
using namespace std;
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);
long a,b;
scanf("%ld %ld\n",&a,&b);
printf("%ld\n",gcd(a,b));
return 0;
}