Cod sursa(job #147347)
Utilizator | Data | 2 martie 2008 20:21:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<stdio.h>
FILE *fin=freopen("euclid2.in","r",stdin),
*fout=freopen("euclid2.out","w",stdout);
long n,m;
long cmmdc(long n,long m)
{
if(n>m)
return cmmdc (m,n-m);
if(m>n)
return cmmdc (n,m-n);
if(n==m)
return n;
}
int main()
{
scanf("%ld %ld",&n,&m);
printf("%d",cmmdc(n,m));
return 0;
}