Submission #2694244

---

Source Code Expand

#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
int map[4][4];
int s(bool f,int n){
	if(f)//行n和 
	return map[n][1]+map[n][2]+map[n][3];
	else//列n和 
	return map[1][n]+map[2][n]+map[3][n];
}
void check(){
	int sum,minn=100;
	for(sum=-1000;sum<=1000;sum++){
		minn=100;
		map[1][3]=sum-map[1][1]-map[1][2];
		minn=min(minn,map[1][3]);
		map[3][3]=sum-map[1][1]-map[2][2];
		minn=min(minn,map[3][3]);
		map[3][2]=sum-map[1][2]-map[2][2];	
		minn=min(minn,map[3][2]);
		map[2][3]=sum-map[1][3]-map[3][3];
		minn=min(minn,map[2][3]);
		map[2][1]=sum-map[2][2]-map[2][3];
		minn=min(minn,map[2][1]);
		map[3][1]=sum-map[1][1]-map[2][1];	
		minn=min(minn,map[3][1]);
		if((minn>=1)&&(s(1,1)==s(1,2))&&(s(1,1)==s(1,3))&&(s(0,1)==s(1,1))&&(s(0,1)==s(0,2))&&(s(0,1)==s(0,3)))
		break;
	}
	return;
}
void print(){
	for(int i=1;i<=3;i++){
		for(int j=1;j<=3;j++){
			cout<<map[i][j]<<" ";
		}
		cout<<"\n";
	}
}
int main(){
	cin>>map[1][1]>>map[1][2]>>map[2][2];
	check();
	//cout<<s(1,1)<<" "<<s(1,2)<<"\n";
	print();
	return 0;
}

Submission Info

Judge Result