Динамическое выделение памяти

#include <iostream>
#include <stdlib.h>
#include <time.h>
 
using namespace std;
 
const int SZ = 5;
 
class Dice{
private:
 int n_kubikov;
 int mas[SZ];
public:
 Dice() {n_kubikov=0;}
 Dice(int);
 Dice(int k, int kk[]);
 friend ostream& operator << (ostream& out, const Dice& d);
 Dice& gen() {
  for(int j = 0; j<n_kubikov; j++)
   mas[j] = rand()%6+1;
  return *this;
 }
 Dice& operator += (int d);
 Dice& operator -= (int d);
 int operator [] (int num) const;
 int sum() const;
 int test() const;
};
 
 
int main(){
 srand(time(NULL));
 Dice b,a(7);
 int array[4] = {-8,5,2,9};
 Dice c(3,array);
 cout << "Kubiki a: " << a << endl;
 cerr << "Kubiki b: " << b << endl;
 cout << "Kubiki c: " << c << endl;
 //c.gen();
 //cout << "Kubiki c: " << c << endl;
 int answer = 0, num;
 do {
  cout << "1. brosit\t";
  cout << "2. dobavit\t";
  cout << "3. izyat\t";
  cout << "4. poluchit ochki\t";
  cout << "5. proverit sovpadeniya\t";
  cout << "0. vykhod" << endl;
  cin >> answer;
  switch(answer) {
   case 1:
   cout << "Rubiki c: " << c << endl;
   c.gen();
   cout << "Rubiki c: " << c << endl;
   break;
   case 2:
   cout << "Kubiki c: " << c << endl;
   cout << "vvedite chislo: ";
   cin >> num;
   c += num;
   cout << "Kubiki c: " << c << endl;
   break;
   case 3:
    cout<< "Kubiki c:"<<c<<endl;
    cout<< "vvedite nomer kubika:";
    cin>>num;
    c -= num;
    cout << "Kubiki c: " << c << endl;
    break;
   case 4:
    cout<<"Kubiki c:"<<c<<endl;
    int s;
    s=c.sum();
    cout<<"Sum="<<s<<endl;
    break;
   case 5:
     int b;
    b=c.test();
    if (b)
    cout<<"sovpadiniya yest"<<endl;
     else
     cout<<"sovpadeniy net"<<endl;
  }
 } while(answer);
 return 0;
}
 
Dice::Dice(int num){
 n_kubikov=num;
 if(n_kubikov<0) {
  cerr << "Invalid set size; assigned 0" << endl;
  n_kubikov = 0;
 }
 
 if(n_kubikov>SZ) {
  cerr << "Invalid set size " << num <<
   "; assigned " << SZ << endl;
  n_kubikov = SZ;
 }
 gen();
}
 
ostream& operator << (ostream& out, const Dice& d) {
 for(int j = 0; j<d.n_kubikov; j++)
  out << d.mas[j] << ' ';
 return out;
}
Dice::Dice(int k, int kk[]){
 n_kubikov = k;
 if(k<0) {
  cerr << "Invalid set size; assigned 0" << endl;
  n_kubikov = 0;
 }
 if(k>SZ) {
  cerr << "Invalid set size " << k <<
   "; assigned " << SZ << endl;
  n_kubikov = SZ;
 }
 for(int j=0;j<n_kubikov;j++) {
  mas[j]=kk[j];
     if(kk[j] <= 0 ) {
   cerr << "Invalid cube value " << kk[j]
    << " replaced 1"<< endl;
   mas[j] = 1;
  }
  if(kk[j] > 6) {
   cerr << "Invalid cube value " << kk[j]
    << " replaced 6"<< endl;
   mas[j] = 6;
  }
 }
}
Dice& Dice::operator += (int p) {
 if(n_kubikov < SZ)  {
  if(p<1) {
   cerr << "Invalid cube value " << p
    << " replaced 1"<< endl;
   p = 1;
  }
  if(p > 6) {
   cerr << "Invalid cube value " << p
    << " replaced 6"<< endl;
   p =6;
  }
  mas[n_kubikov++] = p;
 }
 return *this;
}
 
Dice& Dice::operator -= (int p) {
 if(p<1){
  cerr<<"P stalo 1"<<endl;
  p=1;
 }
   for (int i=0,j=0;i<=n_kubikov;i++){
   // cout<<"i="<<i<<" p="<<p<<endl;
   if(i!=p-1){
   // cout<<"i="<<i<<" mas=";
   // cout<<mas[i]<< endl;
    mas[j]=mas[i];
    j++;
   }
   }
 n_kubikov--;
    return *this;
}
 
int Dice::sum()const{
 int s=0;
 for(int i=0;i<n_kubikov;i++){
  //cout<<"i="<<i<<endl;
  //cout<<"s="<<s<<endl;
  //cout<<"mas[i]="<<mas[i]<<endl;
  s+=mas[i];
 }
 return s;
}
 
int Dice::test()const{
 bool flag = 0;
 for(int i=0;i<n_kubikov-1;i++){
  for(int j=i+1;j<n_kubikov;j++){
   if (mas[i]==mas[j])
    flag=1;
  }
 }
 return flag;
}

int *mass;

cin<<SZ;

mass=new int[N]

mass=new int[N];

mass=new int[SZ];