Cod sursa(job #150702)
Utilizator | Data | 7 martie 2008 11:50:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <stdio.h>
long long euclid (long long x,long long y)
{
while (x&&y)
if (x<y) x=y%x; else y=x%y;
return (x)?(x):(y);
}
int main ()
{
long long n,m;
fscanf(fopen("euclid2.in","r"),"%lld %lld",&n,&m);
fprintf(fopen("euclid2.out","w"),"%lld\n",euclid(n,m));
return 0;
}