Submission #1125737

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF (1LL<<25)     //33554432
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

signed main(void)
{
  int a, b, c;
  cin >> a >> b >> c;

  int x[3][3];
  REP(i, 101) {
    REP(j, 3) REP(k, 3) x[j][k] = 0;
    x[0][0] = a;
    x[0][1] = b;
    x[1][1] = c;
    int sum = a+b+i;
    x[0][2] = i;
    x[2][1] = sum - x[0][1] - x[1][1];
    x[2][0] = sum - x[0][2] - x[1][1];
    x[2][2] = sum - x[0][0] - x[1][1];
    x[1][0] = sum - x[0][0] - x[2][0];
    x[1][2] = sum - x[0][2] - x[2][2];

    bool flag = true;
    if(x[0][0] + x[0][1] + x[0][2] != sum) flag = false;
    if(x[1][0] + x[1][1] + x[1][2] != sum) flag = false;
    if(x[2][0] + x[2][1] + x[2][2] != sum) flag = false;
    if(x[0][0] + x[1][0] + x[2][0] != sum) flag = false;
    if(x[0][1] + x[1][1] + x[2][1] != sum) flag = false;
    if(x[0][2] + x[1][2] + x[2][2] != sum) flag = false;
    if(x[0][0] + x[1][1] + x[2][2] != sum) flag = false;
    if(x[0][2] + x[1][1] + x[2][0] != sum) flag = false;

    if(flag) {
      REP(j, 3) {
        REP(k, 3) {
          cout << x[j][k] << " ";
        }
        cout << endl;
      }
    }
  }

  return 0;
}

Submission Info

Judge Result