#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int f[9];
int b[9];
int a[9]={1,2,3,4,5,6,7,8,9};
int judge[8];
int main()
{for (int i = 0; i < 9; ++i) {cin>>f[i];}int ans=0;do{judge[0] = a[0] + a[1] + a[2]; // 三行judge[1] = a[3] + a[4] + a[5];judge[2] = a[6] + a[7] + a[8];judge[3] = a[0] + a[3] + a[6]; // 三列judge[4] = a[1] + a[4] + a[7];judge[5] = a[2] + a[5] + a[8];judge[6] = a[0] + a[4] + a[8]; // 兩條對角線judge[7] = a[2] + a[4] + a[6];int flag=1;for(int i=0;i<8;i++){if(judge[0]!=judge[i]) {flag=0;break;}}if(flag==1){for (int i = 0; i < 9; ++i) {if(f[i]&&a[i]!=f[i]){flag=0;break;}}if (flag==1) {ans++;for(int i=0;i<9;i++) b[i]=a[i];}}}while (next_permutation(a,a+9));if(ans>1) cout<<"Too Many";else{for (int i = 0; i < 9; ++i) {if(i%3==0) cout<<endl;cout<<b[i]<<" ";}}return 0;
}
版权声明:本站所有资料均为网友推荐收集整理而来,仅供学习和研究交流使用。
工作时间:8:00-18:00
客服电话
电子邮件
admin@qq.com
扫码二维码
获取最新动态