Cod sursa(job #144971)
Utilizator | Data | 28 februarie 2008 10:44:02 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <stdio.h>
long n,m;
int main(){
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%ld %ld",&n,&m);
while (n!=m)
if (n>m){n=n%m;if (!n)n=m;}
else {m=m%n;if (!m)m=n;}
printf("%ld\n",n);
return 0;
}