-
Notifications
You must be signed in to change notification settings - Fork 87
/
005-02.cpp
82 lines (71 loc) · 1.56 KB
/
005-02.cpp
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
#include <iostream>
using namespace std;
const long long mod = 1000000007;
const int MAX_N = 33;
struct Matrix {
int sz; // sz × sz 行列
long long x[MAX_N][MAX_N];
};
Matrix multiply(Matrix A, Matrix B) {
// A × B を求める
Matrix C;
C.sz = A.sz;
for (int i = 0; i < C.sz; i++) {
for (int j = 0; j < C.sz; j++) C.x[i][j] = 0;
}
for (int i = 0; i < A.sz; i++) {
for (int j = 0; j < A.sz; j++) {
for (int k = 0; k < A.sz; k++) {
C.x[i][k] += A.x[i][j] * B.x[j][k];
C.x[i][k] %= mod;
}
}
}
return C;
}
Matrix powers(Matrix A, long long T) {
// A の T 乗を求める
Matrix E[64], F;
E[0] = A;
for (int i = 1; i < 62; i++) {
E[i] = multiply(E[i - 1], E[i - 1]);
}
F.sz = E[0].sz;
for (int i = 0; i < F.sz; i++) {
for (int j = 0; j < F.sz; j++) {
if (i == j) F.x[i][j] = 1;
if (i != j) F.x[i][j] = 0;
}
}
for (int i = 62; i >= 0; i--) {
if ((T & (1LL << i)) != 0LL) {
F = multiply(F, E[i]);
}
}
return F;
}
// 入力
long long N, B, K;
long long C[11];
int main() {
// Step #1. 入力
cin >> N >> B >> K;
for (int i = 1; i <= K; i++) cin >> C[i];
// Step #2. 行列 A を求める
Matrix A; A.sz = B;
for (int i = 0; i < B; i++) {
for (int j = 0; j < B; j++) A.x[i][j] = 0;
}
for (int i = 0; i < B; i++) {
for (int j = 1; j <= K; j++) {
int nex = (i * 10 + C[j]) % B;
A.x[i][nex] += 1;
}
}
// Step #3. 行列累乗をする
Matrix Z = powers(A, N);
// Step #4. 答えを求める
long long Answer = Z.x[0][0];
cout << Answer << endl;
return 0;
}