Cod sursa(job #151699)
Utilizator | Data | 8 martie 2008 15:37:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream.h>
#include<stdlib.h>
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
long a,b,div=1,min,i,max;
fin>>a>>b;
if(a<b)min=a;
else min=b;
if(abs(a-b)<5000) {
while(a!=b)
{
if(a>b) a=a-b;
else b=b-a;
} div=a;}
else for(i=2;i<min;i++)
if(!(a%i&&b%i)) div=i;
fout<<div;
return 0;
}