1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef pair<ll, int> PILL;
typedef pair<ll, ll> PLL;

const int MAX_N = 1e5+5;
const int M = 1e6;
const ll INF = (ll)(1e18);
const int inf = 1e9;
const ll MOD = 1000000007LL;

void solve() {

}

int n;

void brute_force() {
    int r[3];
    string s[3];
    cin >> r[0] >> s[0];
    cin >> r[1] >> s[1];
    cin >> r[2] >> s[2];

    int ans = 0;
    for (int i = 0; i < (1 << n); i++) {
        string cur = "";
        for (int j = 0; j < n; j++) {
            if (i & (1 << j)) {
                cur += '1';
            } else {
                cur += '0';
            }
        }
        //cout << cur << "\n";
        vector<int> cnt(3, 0);
        for (int j = 0; j < cur.size(); j++) {
            cnt[0] += (cur[j] != s[0][j]);
            cnt[1] += (cur[j] != s[1][j]);
            cnt[2] += (cur[j] != s[2][j]);
        }
        if (cnt[0] <= r[0] || cnt[1] <= r[1] || cnt[2] <= r[2]) {
        	ans++;
        	//cout << cur << "\n";
        }
    }

    cout << ans;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;
    if (n <= 20) {
        brute_force();
        return 0;
    }

    cout << 1;


    return 0;
}