Submission #33219

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <sstream>

using namespace std;

int main() {
    vector<int> l(6);
    map<int, int> e;
    int b;
    int count = 0;
    int bonus = 0;
    for (int i=0; i<6; i++) {
        int tmp;
        cin >> tmp;
        e[tmp] = 1;
    }
    cin >> b;
    for (int i=0; i<6; i++) {
        cin >> l[i];
    }

    for (int i=0; i<6; i++) {
        if (e[l[i]] == 1)count++;
        if (l[i] == b)bonus++;
    }
    
    int res = 0;
    switch(count) {
    case 6:
        res = 1;
        break;
    case 5:
        if (bonus == 1) {
            res = 2;
        } else {
            res = 3;
        }
        break;
    case 4:
        res = 4;
        break;
    case 3:
        res = 5;
        break;
    default:
        break;
    }

    cout << res << endl;
}

Submission Info

Judge Result