不输出求调

#include<bits/stdc++.h>
using namespace std;
int a[15][15];
bool h[15][15],l[15][15],g[15][15];
int mp[15][15]={
{0,1,1,1,2,2,2,3,3,3},
{0,1,1,1,2,2,2,3,3,3},
{0,1,1,1,2,2,2,3,3,3},
{0,4,4,4,5,5,5,6,6,6},
{0,4,4,4,5,5,5,6,6,6},
{0,4,4,4,5,5,5,6,6,6},
{0,7,7,7,8,8,8,9,9,9},
{0,7,7,7,8,8,8,9,9,9},
{0,7,7,7,8,8,8,9,9,9},
};
void dfs(int x,int y){
	if(a[x][y]!=0){
		if(x==9 && y==9){
			for(int i=1;i<=9;i++){
				for(int j=1;j<=9;j++){
					cout<<a[i][j]<<" ";
				}
				cout<<endl;
			}
		}
		if(x==9) dfs(1,y+1);
		if(y==9) dfs(x+1,1);
	}
	else{
		for(int i=1;i<=9;i++){
			if(!h[x][i] && !l[y][i] && !g[mp[x][y]][i]){
				a[x][y]=i;
				h[x][i]=0;
				l[y][i]=0;
				g[mp[x][y]][i]=0;
				if(x==9 && y==9){
					for(int i=1;i<=9;i++){
						for(int j=1;j<=9;j++){
							cout<<a[i][j]<<" ";
						}
						cout<<endl;
					}
				}
				if(x==9) dfs(1,y+1);
				if(y==9) dfs(x+1,1);
				a[x][y]=0;
				h[x][i]=1;
				l[y][i]=1;
				g[mp[x][y]][i]=1;
			}
		}
	}
}
int main(){
	for(int i=1;i<=9;i++){
		for(int j=1;j<=9;j++){
			cin>>a[i][j];
			if(a[i][j]!=0){
				h[i][a[i][j]]=1;
				l[j][a[i][j]]=1;
				g[mp[i][j]][a[i][j]]=1;
			}
		}
	}
	dfs(1,1);
	return 0;
}