ds2001916的博客

#include<iostream> using namespace std; const int n = 8; int tile = 0; int board[n][n] ; //棋盘的中心总为tr+s-1,tc+s-1 tr+s-1,tc+s tr+s,tc+s-1 tr+s,tc+s //tr,tc为递归的启示位置 void chessBoard (int tr,int tc,int dr,int dc,int size) { if(size == 1){

#include<iostream> using namespace std; int BinarySearch(int a[], int x, int n){ //在a[0]<=a[1]<=...<=a[n-1]中搜索x //找到x时返回位置，未找到返回-1 int left = 0; int right = n-1; while(left <= right){ int middle = (left + rig