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
84
85
86
87
88
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <set>
#include <vector>
using namespace std;
const int INF = ~0u>>1;
typedef pair <int,int> P;
#define MID(x,y) ((x+y)>>1)
#define iabs(x) ((x)>0?(x):-(x))
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define mp make_pair
#define print() cout<<"--------"<<endl
typedef long long ll;
#define maxn 100010
ll ans[16][16];
#define N 16
void product_mod(ll a[][16], ll b[][16],int n, ll mod){
ll c[N][N] = {};
for (int i = 0; i < n; i ++){
for (int j = 0; j < n; j ++){
for (int k = 0; k < n; k ++){
c[i][j] += a[i][k] * b[k][j];
}
c[i][j] %= mod;
}
}
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
a[i][j] = c[i][j];
}
}
}
void power_mod(ll a[][N], ll x, int n, ll mod){
memset(ans, 0, sizeof(ans));
for (int i = 0; i < n; i ++) ans[i][i] = 1;
while (x){
if (x&1) product_mod(ans, a, n, mod);
product_mod(a, a, n, mod);
x >>= 1;
}
}
ll a[N][N];
int bits[N];
void init(){
for (int i = 0; i < 4; i++)
bits[i] = (1<<i);
memset(a,0,sizeof(a));
int tmp;
for (int i = 0; i < 16; i++){
a[i][(~i & 0xf)] = 1;
tmp = (~i & 0xf);
for (int j = 0; j < 3; j ++){
if ((tmp & bits[j]) == 0 && (tmp & bits[j + 1]) == 0){
a[i][tmp | bits[j] | bits[j+1]] = 1;
}
}
}
a[15][15] = 1;
}
int main(){
int n, mod;
while (~scanf("%d%d", &n, &mod) && (n + mod)){
init();
power_mod(a, n, 16, (long long)mod);
printf("%lldn", ans[15][15]);
}
return 0;
}
|