Submission #75424820

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
const long long INF = (1LL << 62) - (1LL << 31) - 1;
int di[4] = {-1,0,1,0};
int dj[4] = {0,-1,0,1};

int main() {
    vector<int> a(6), b(6), c(6);
    for (int i = 0; i < 6; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < 6; i++) {
        cin >> b[i];
    }
    for (int i = 0; i < 6; i++) {
        cin >> c[i];
    }

    double bunbo = 6 * 6 * 6;
    double bunshi = 0;
    for (int i = 0; i < 6; i++) {
        for (int j = 0; j < 6; j++) {
            for (int k = 0; k < 6; k++) {
                set<int> me;
                me.insert(a[i]); me.insert(b[j]); me.insert(c[k]);
                auto ita = me.find(4); auto itb = me.find(5); auto itc = me.find(6);
                if (ita != me.end() && itb != me.end() && itc != me.end()) {
                    bunshi++;
                }
            }
        } 
    }

    cout << fixed << setprecision(7) << bunshi / bunbo << endl;
    return 0;
}

Submission Info

Judge Result