Submission #1518221

---

Source Code Expand

#include <set>
#include <iostream>
using namespace std;

int main()
{
    set<int> s[3];
    s[0].insert(1);
    s[0].insert(3);
    s[0].insert(5);
    s[0].insert(7);
    s[0].insert(8);
    s[0].insert(10);
    s[0].insert(12);
    s[1].insert(4);
    s[1].insert(6);
    s[1].insert(9);
    s[1].insert(11);
    s[2].insert(2);
    

    int x, y;
    bool is_found = false;
    cin >> x >> y;
    for(int i = 0; i < 2; i++){
	    if(s[i].find(x) != s[i].end() && s[i].find(y) != s[i].end()){
		    is_found = true;
	    }
    }
    if(is_found){
	    cout << "Yes" << endl;
    }else{
	    cout << "No" << endl;
    }

    return 0;
}

Submission Info

Judge Result