Submission #3622268

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i, n) for(int i =0; i < n ;i++)
using namespace std;
int c[3][3];


bool fb(int i, int j){
    if((c[0][i] - c[0][j] == c[1][i] - c[1][j])&
        (c[1][i] - c[1][j] == c[2][i] - c[2][j])&
        (c[2][i] - c[2][j] == c[0][i] - c[0][j]))
        {
             return true;
        }
    else{
        return false;
    }
    
}
bool fa(int i, int j){
    if((c[i][0] - c[j][0] == c[i][1] - c[j][1])&
        (c[i][1] - c[j][1] == c[i][2] - c[j][2])&
        (c[i][2] - c[j][2] == c[i][0] - c[j][0]))
        {
             return true;
        }
    else{
        return false;
    }
    
}

int main()
{
    rep(i, 3){
        cin >> c[i][0] >> c[i][1] >> c[i][2];
    }

    if(fb(0, 1) &fb(1, 2)& fb(2, 0)& fa(0, 1)& fa(1, 2)& fa(2, 0)){
        std::cout << "Yes" << std::endl;
    }
    else{
        std::cout << "No" << std::endl;
        }
    

    return 0;
}

Submission Info

Judge Result