/*
Name:九宫格
Coder:Lou Jianghui
Test case:
case 1:
Input:
8 0 0 0 0 0 0 0 0
0 0 3 6 0 0 0 0 0
0 7 0 0 9 0 2 0 0
0 5 0 0 0 7 0 0 0
0 0 0 0 4 5 7 0 0
0 0 0 1 0 0 0 3 0
0 0 1 0 0 0 0 6 8
0 0 8 5 0 0 0 1 0
0 9 0 0 0 0 4 0 0
Output:
8 1 2 7 5 3 6 4 9
9 4 3 6 8 2 1 7 5
6 7 5 4 9 1 2 8 3
1 5 4 2 3 7 8 9 6
3 6 9 8 4 5 7 2 1
2 8 7 1 6 9 5 3 4
5 2 1 9 7 4 3 6 8
4 3 8 5 2 6 9 1 7
7 9 6 3 1 8 4 5 2
Debug&Self-examination:
1、写程序之前应该有完整的构想,特别是细节处应该尽量考虑充分
2、能简单的代码尽量简单,这样能避免出错
3、尽量降低代码冗余度
*/
Code:
#include<iostream>
#include<stdlib.h>
using namespace std;
#define N 9
int map[10][10];
int flag = 0;
int m ;
void print()
{
int i, j;
for (i = 0; i < N; i++){