Problem-Solving/2780.cpp at master · Eastplanet/Problem-Solving · GitHub

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
71
72
73
74
75
76
77
78
79
80
81
82
83
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include <string>

using namespace std;

int N;
int dp[1001][10];

int pass(int leng, int now) {
    if (leng == 1)return 1;
    if (dp[leng][now] != -1)return dp[leng][now];

    int val;

    switch (now)
    {
    case 0:
        val = pass(leng - 1, 7) % 1234567;
        dp[leng][now] = val;
        return val;
    case 1:
        val = pass(leng - 1, 2)%1234567 + pass(leng - 1, 4) % 1234567;
        dp[leng][now] = val % 1234567;
        return dp[leng][now];
    case 2:
        val = pass(leng - 1, 1) % 1234567 + pass(leng - 1, 3) % 1234567 + pass(leng - 1, 5) % 1234567;
        dp[leng][now] = val % 1234567;
        return dp[leng][now];
    case 3:
        val = pass(leng - 1, 2) % 1234567 + pass(leng - 1, 6) % 1234567;
        dp[leng][now] = val % 1234567;
        return dp[leng][now];
    case 4:
        val = pass(leng - 1, 1) % 1234567 + pass(leng - 1, 5) % 1234567 + pass(leng - 1, 7) % 1234567;
        dp[leng][now] = val % 1234567;
        return dp[leng][now];
    case 5:
        val = pass(leng - 1, 2) % 1234567 + pass(leng - 1, 4) % 1234567 + pass(leng - 1, 6) % 1234567 + pass(leng - 1, 8) % 1234567;
        dp[leng][now] = val % 1234567;
        return dp[leng][now];
    case 6:
        val = pass(leng - 1, 3) % 1234567 + pass(leng - 1, 5) % 1234567 + pass(leng - 1, 9) % 1234567;
        dp[leng][now] = val % 1234567;
        return dp[leng][now];
    case 7:
        val = pass(leng - 1, 4) % 1234567 + pass(leng - 1, 8) % 1234567 + pass(leng - 1, 0) % 1234567;
        dp[leng][now] = val % 1234567;
        return dp[leng][now];
    case 8:
        val = pass(leng - 1, 5) % 1234567 + pass(leng - 1, 7) % 1234567 + pass(leng - 1, 9) % 1234567;
        dp[leng][now] = val % 1234567;
        return dp[leng][now];
    case 9:
        val = pass(leng - 1, 6) % 1234567 + pass(leng - 1, 8) % 1234567;
        dp[leng][now] = val % 1234567;
        return dp[leng][now];
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    fill(&dp[0][0], &dp[1000][10], -1);

    int T;
    cin >> T;
    while (T--) {
        int N;
        cin >> N;
        int sum = 0;
        for (int i = 0; i < 10; i++) {
            sum = (sum % 1234567 + pass(N, i) % 1234567) % 1234567;
        }
        cout << sum << '\n';
    }


}