int gcd(int x, int y)
{
        if (y == 0)
                return x;
        return gcd(y, x % y);
}

int GCD(int i, int j)
{
    while(i&&j)
    {
       if(i<j)
        j%=i;
       else
        i%=j;
    }
    return i|j;
}

int gcd ( int n, int m ){
		if(n==m)
			return n ;
		if (n<m)
			return gcd(n,m-n );
		return gcd(n-m,m ); 
	}

#include <stdio.h>
#include <conio.h>
 
int gcd(int n, int m)
  {if (m == 0)
    return n;
 return gcd(m, n % m);
}
main()
	{ int n,m,nsd;
	  printf("BBEDIT6 2 4isla : ");
	  scanf("%d%d",&n,&m);
	 nsd=gcd(n,m);
	  printf("NAYBILSHUY SPILNUY DILNUK = %d and %d is %d",n,m,nsd);
      getch();
	  return 0;
 
	}
// 30 і 18.
//30 - 18 = 12
///18 - 12 = 6
///12 - 6 = 6
////6 – 6 = 0  stop
//(30, 18) = 6

int nod(int a, int b)
{
   while (a!=0 && b!=0)
   {
      if(a>b) a = a%b; // a %= b; - деление по модулю
      else    b = b%a; // b %= a;
   }
   return a+b;
}