I Chiitoitsu

#include 
#include 
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;

ll f[15][34 * 4 + 10];

ll qmi(ll a, ll b) {
    ll res = 1 % mod;
    while (b) {
        if (b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

int main() {
    int _; cin >> _;
    int last = 34 * 4 - 13;
    for (int i = 1; i <= 13; ++ i) {
        for (int j = 1; j <= last; ++ j) {
//            3 * i / j
            if (j < 3 * i) continue;
            ll now = 3ll * i % mod * qmi(j, mod - 2) % mod;
            if (i == 1) {
                f[i][j] = (((mod + 1 - now) % mod) * f[1][j - 1] % mod + 1ll) % mod;
            } else {
                f[i][j] = (now * f[i - 2][j - 1] % mod + (mod + 1 - now) % mod * f[i][j - 1] % mod + 1ll) % mod;
            }
        }
    }
    for (int test = 1; test <= _; ++ test) {
        string ss[15];
        string s;
        cin >> s;
        for (int i = 0; i < 13; ++ i) {
            ss[i] = s[i * 2];
            ss[i] += s[i * 2 + 1];
        }
        sort(ss, ss + 13);
        int duitsu = 0;
        for (int i = 0; i < 12; ++ i) {
            duitsu += (ss[i] == ss[i + 1]);
        }
        printf("Case #%d: %lld\n", test, f[13 - 2 * duitsu][last]);
    }
}

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