Please convert my JAVA code into C++ . Please DONT change my code just convert it into C++

Output should looking something like this:

1 34 3 18 49 32 13 16 4 19 56 33 14 17 50 31 57 2 35 48 55 52 15 12 20 5 60 53 36 47 30 51 41 58 37 46 61 54 11 26 6 21 42 59 38 27 64 29 43 40 23 8 45 62 25 10 22 7 44 39 24 9 28 63 

Here is my code . Please DONT change my code just convert it into C++

The Knight's Tour is a mathematical problem involving a knight on a chessboard. The knight is placed on the empty board and, moving according to the rules of chess, must visit each square exactly once. There are several billion solutions to the problem, of which about 122,000,000 have the knight finishing on the same square on which it begins. When this occurs the tour is said to be closed. Your assignment is to write a program that gives a solution to the Knight's Tour problem recursively. 1 - public class knightsTours \{ private class constants private constants() \{ static final int chessBoard_Size =8; static final int moves =8j private static int[][] chessboard; private static int[] X_Moves ={2,1,1,2,2,1,1,2} private static int[] yMoves ={1,2,2,1,1,2,2,1}; void KnightTours() \{ this. chessboard private void initBoard() (int i=0;i i++ ) (int j=0;j= constants. chessioard_size) if ( y= constants. chessBoard_size) return false; if (chessBoard[x][y] != Integer.MIN_VALUE) return false; return true; private static void actual_KnightsTours_solution() or (int i=0;i