Submission #1986288

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <array>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
typedef vector<double> VD;

int main() {
    int a[3][3];

    cin >> a[0][0] >> a[0][1] >> a[1][1];

    a[2][0] = a[0][0] + a[0][1] - a[1][1];
    a[2][2] = a[0][1] + a[1][1] - a[2][0];
    a[1][2] = a[0][0] + a[0][1] - a[2][2];
    a[2][1] = a[0][0] + a[2][2] - a[0][1];
    a[1][0] = a[0][1] + a[2][1] - a[1][2];
    a[0][2] = a[1][1] + a[2][1] - a[0][0];


    REP(i,3){
        REP(j,3) cout << a[i][j] << " ";
        cout << endl;
    }

    return 0;
}

Submission Info

Judge Result