棋盘覆盖实现方法.docxVIP

数据结构:棋盘覆盖实现方法 棋盘覆盖问题的解决方法，使用 C 语言编成的，大家一起看看吧。#include stdio.h #define MAXSIZE 110 int chess[MAXSIZE][MAXSIZE]; void chess_board(int tr, int tc, int dr, int dc, int size) ...{ static int tile = 1; if(1==size) return; int t = tile++; int s = (size1); /**//* ---- left-up corner */ if(drtr+s amp;amp; dctc+s). { chess_board(tr, tc, dr, dc, s); } else { chess[tr+s-1][tc+s-1] = t; chess_board(tr, tc, tr+s-1, tc+s-1, s); } /**//* ---- right-up corner */ if(drtr+s amp;amp; dc=tc+s). { chess_board(tr, tc+s, dr, dc, s); } else { chess[tr+s-1][tc+s] = t; chess_board(tr, tc+s, tr+s-1, tc+s, s); } /**//* ---- left-down corner */ if(dr=tr+s amp;amp; dctc+s). { chess_board(tr+s, tc, dr, dc, s); } else { chess[tr+s][tc+s-1] = t; chess_board(tr+s, tc, tr+s, tc+s-1, s); } /**//* ---- right-down corner-- */ if(dr=tr+s amp;amp; dc=tc+s). { chess_board(tr+s, tc+s, dr, dc, s); } else { chess[tr+s][tc+s] = t; chess_board(tr+s, tc+s, tr+s, tc+s, s); } } void print_chess(int size) ...{ int i, j; for(i = 0; isize; i++). { for(j=0; jsize; j++) printf(\%4d\, chess[i][j]); printf(\ \); } } int main( int argc, char *argv[] ) ...{ chess_board(0, 0, 1, 2, 16); print_chess(16); return 0; } /**//* ---------- end of function main */