Try to use backtracking to solve reasoning problems

#include stdio.h
class TuiLi //Inference class
{ 
//Private method part
protected: 

SYSTEMTIME TIME; //Standard system time storage structure with 8 members and 16 bytes

struct FZ
{
int ys;
int yp;
int gj;
int cw;
int yl;
};//House attribute structure

FZ Fz[5];//Define 5 houses
int Biao[120][5];//Define combination table
int gj,ys,yl,cw,yp;//Combination flag
int sz[25];

//Solve Sudoku with
int sudu[81]; //Record backtracking path with
bool sudu_ji[81]; //Used to mark the value indicated by the question
int SD[9][9]; //Sudoku chessboard

//Solve N queens problem
int N;//Used to input the scale of the queen problem. In this example, only 33 queens can be solved because of memory allocation. Changing the memory allocation size can increase the scale of the problem.
int hh[1024]; //Record the backtracking path for solving the 33 queens problem at most
int HH[33][33];//Queen problem chessboard



//Public method part 
public:
TuiLi(void); 
~TuiLi(void);
void init_biao(void);//Initialize the combination table
void print(void);//Screen output
void gx(void);//Refresh the reasoning result
int OK(void);//Inference pruning condition
int go(void);//Main entry method for reasoning questions

int ok_sd(void);//Sudoku pruning condition
int go_sd(void);//Solve the population point of Sudoku
void sd_in(void);//Board data input
void SD_in(void);//Get the question information
void sd_out(void);//Board data output
void sd_print(void);//Screen output result

int ok_hh(int m);//Queen problem pruning function
int ok_hh_sc(void);//Final test
int go_hh(void); //Queen problem entry point
void hh_init(void);//Initialize chessboard data
void hh_out(void);//Chessboard data refresh
void hh_print(void);//Output result

};