Submission #1773898

---

Source Code Expand

#include <iostream>
#include <iomanip> // << fixed << setprecision(xxx)
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <vector>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <complex>
#include <tuple> // get<n>(xxx)
#include <queue>
#include <stack>
#include <map> // if (M.find(key) != M.end()) { }
#include <set> // S.insert(M);
// if (S.find(key) != S.end()) { }
// for (auto it=S.begin(); it != S.end(); it++) { }
// auto it = S.lower_bound(M);
#include <random> // random_device rd; mt19937 mt(rd());
#include <cctype>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib> // atoi(xxx)
using namespace std;

#define DEBUG 0 // change 0 -> 1 if we need debug.
// insert #if<tab> by my emacs. #if DEBUG == 1 ... #end

typedef long long ll;

// const int dx[4] = {1, 0, -1, 0};
// const int dy[4] = {0, 1, 0, -1};

// const int C = 1e6+10;
// const ll M = 1000000007;

int main () {
  int x[100];
  x[1] = 1;
  x[2] = 3;
  x[3] = 1;
  x[4] = 2;
  x[5] = 1;
  x[6] = 2;
  x[7] = 1;
  x[8] = 1;
  x[9] = 2;
  x[10] = 1;
  x[11] = 2;
  x[12] = 1;
  int a, b;
  cin >> a >> b;
  if (x[a] == x[b]) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}

Submission Info

Judge Result