Submission #1005083

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

int main() {
  vi a(3);
  rep(i, 3) {
    scanf("%d", &a[i]);
  }
  vvi ans(3, vi(3));
  ans[0][0] = a[0];
  ans[0][1] = a[1];
  ans[1][1] = a[2];
  int sum = a[2] * 3;
  ans[0][2] = sum - ans[0][0] - ans[0][1];
  ans[2][0] = sum - ans[0][2] - ans[1][1];
  ans[2][1] = sum - ans[0][1] - ans[1][1];
  ans[2][2] = sum - ans[2][0] - ans[2][1];
  ans[1][0] = sum - ans[0][0] - ans[2][0];
  ans[1][2] = sum - ans[1][0] - ans[1][1];
  rep (i, 3) {
    rep (j, 3) {
      printf("%d%c", ans[i][j], (j == 2) ? '\n' : ' ');
    }
  }
  return 0;
}

Submission Info

Judge Result