#include <stdlib.h>

class zbior
{


 public:
         zbior(int k){ z=new int [k]; };
         zbior(const zbior &z1){ n=z1.n; z=new int [n]; };
         ~zbior() { delete [] z; };

         void empty();
         zbior operator <(int); //wstawianie int do zbioru
         zbior operator >(int); //wstawianie ze zbioru do int
         zbior operator *=(zbior&);
         zbior operator *(zbior&);

private:
         int *z;
         int n;
};

void zbior::empty()
{
 int i;
 for (i=0;i<n+1;i++)
   z[i]=0;
};

zbior zbior::operator <(int k)
{
 int *tmp=new int [n];
 int i;


 for (i=0;i<n+1;i++) tmp[i]=z[i];

 delete [] z;
 n=n+1;
 z=new int [n];
 for (i=0;i<n;i++) z[i]=tmp[i];
 z[n-1]=k;

 return (*this);
};

zbior zbior::operator >(int k)
{
 int tmp2=z[n];
 int i;

 n--;
 int *tmp;
 tmp=new int [n];

 for (i=0;i<n+1;i++) tmp[i]=z[i];

 delete [] z;
 z=new int [n];
 for (i=0;i<n;i++) z[i]=tmp[i];

 return tmp2;
};



zbior zbior::operator*=(zbior& z1)
{
  int *cw;
  int i,c;

  if (z1.n>n) { int tmp=n; n=z1.n; z1.n=tmp; }

  for (i=0;i<n+1;i++)
  {
    while()
  }

};