在距矩阵k的距离内找到元素

int width = 4;
int height = 4;
int k = 1;
int value = 2;

bool hasRight = (value % width != 0);
bool hasLeft = (value % width != 1);
bool hasTop = (value > 4);
bool hasBottom = (value < (height * width - width));

cout << value;  // Always itself
if(hasRight == true) {
 cout << value+1 << \" \";  // Right
 if(hasTop == true) {
  cout << value-width << \" \" << value-width+1 << \" \"; // Top and Top-right
 }
 if(hasBottom == true) {
  cout << value+width << \" \" << value+width+1; // Bottom and Bottom-right
 }
}

if(hasLeft == true) {
 cout << value-1 << \" \";  // Left
 if(hasTop == true) {
  cout << value-width-1 << \" \";  // Top-left
 }
 if(hasBottom == true) {
  cout << value+width-1 << \" \";  // Bottom-left
 }
}