Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var scanner = bufio.NewScanner(os.Stdin)

// 文字列を1行取得
func StrStdin() (stringReturned string) {
//	scanner := bufio.NewScanner(os.Stdin)

	scanner.Scan()
	stringInput := scanner.Text()

	stringReturned = strings.TrimSpace(stringInput)
	return
}

// 整数値1つ取得
func IntStdin() (int, error) {
	stringInput := StrStdin()
	return strconv.Atoi(strings.TrimSpace(stringInput))
}

// 空白や空文字だけの値を除去したSplit()
func SplitWithoutEmpty(stringTargeted string, delim string) (stringReturned []string) {
	stringSplited := strings.Split(stringTargeted, delim)

	for _, str := range stringSplited {
		if str != "" {
			stringReturned = append(stringReturned, str)
		}
	}

	return
}

// デリミタで分割して文字列スライスを取得
func SplitStrStdin(delim string) (stringReturned []string) {
	// 文字列で1行取得
	stringInput := StrStdin()

	// 空白で分割
	// stringSplited := strings.Split(stringInput, delim)
	stringReturned = SplitWithoutEmpty(stringInput, delim)

	return
}

// デリミタで分割して整数値スライスを取得
func SplitIntStdin(delim string) (intSlices []int, err error) {
	// 文字列スライスを取得
	stringSplited := SplitStrStdin(" ")

	// 整数スライスに保存
	for i := range stringSplited {
		var iparam int
		iparam, err = strconv.Atoi(stringSplited[i])
		if err != nil {
			return
		}
		intSlices = append(intSlices, iparam)
	}
	return
}

func main() {
	nk, _ := SplitIntStdin(" ")
	n, k := nk[0], nk[1]
	kind := make([]int, n)
	for i := 0; i < k; i++ {
		var tmp []int
		var err error
		if tmp, err = SplitIntStdin(" "); err != nil {
			panic(err)
		}
		kind[tmp[0]-1] = tmp[1]
	}
	dp := make([][3][3]int, n)
	if kind[0] > 0 {
		dp[0][0][kind[0]-1] = 1
	} else {
		for i := 0; i < 3; i++ {
			dp[0][0][i] = 1
		}
	}
	if kind[1] > 0 {
		for i := 0; i < 3; i++ {
			dp[1][i][kind[1]-1] = dp[0][0][i]
		}
	} else {
		for i := 0; i < 3; i++ {
			for j := 0; j < 3; j++ {
				dp[1][i][j] = dp[0][0][i]
			}
		}
	}
	for i := 1; i < n-1; i++ {
		if kind[i+1] > 0 {
			for j := 0; j < 3; j++ {
				if j == kind[i+1]-1 {
					for k := 0; k < 3; k++ {
						if j != k {
							dp[i+1][j][kind[i+1]-1] += dp[i][k][j]
							dp[i+1][j][kind[i+1]-1] %= 10000
						}
					}
				} else {
					for k := 0; k < 3; k++ {
						dp[i+1][j][kind[i+1]-1] += dp[i][k][j]
						dp[i+1][j][kind[i+1]-1] %= 10000
					}
				}
			}
		} else {
			for j := 0; j < 3; j++ {
				for k := 0; k < 3; k++ {
					for l := 0; l < 3; l++ {
						if j != k || k != l {
							dp[i+1][k][j] += dp[i][l][k]
							dp[i+1][k][j] %= 10000
						}
					}
				}
			}
		}
	}
	result := 0
	for i := 0; i < 3; i++ {
		for j := 0; j < 3; j++ {
			result += dp[n-1][i][j]
		}
	}
	// fmt.Println(dp)
	// fmt.Println(kind)
	fmt.Println(result % 10000)
}

C++: #include<iostream>
#include<vector>

using namespace std;

int solve(int,int,int);

int n,k,cnt;
vector<int> d;
int memo[101][4][4];

int main(){
	cin >> n >> k;
	d.resize(n);
	
	for(int i=0;i<k;i++){
		int tmp;
		cin >> tmp;
		cin >> d[tmp];
	}
	cout << solve(1,0,0) << endl;
	return 0;
}

int solve(int day,int old_type,int type){
	int rec = 0;
	if(memo[day][old_type][type] != 0)return memo[day][old_type][type];
	
	if(day == n+1){
		rec = 1;
	}
	else if(d[day] != 0){
		if(old_type == type && type == d[day])rec = 0;
		else rec = solve(day+1,type,d[day]);
	}
	else{
		for(int i=1;i<=3;i++){
			if(old_type == type && type == i)continue;
			rec += solve(day+1,type,i);
		}
	}
	return memo[day][old_type][type] = rec%10000;
}

C++: #include<iostream>
#include<cstring>
using namespace std;

int main(){
	int n,m,d[1000],t[1000],type[4][100],c[4][100];
	cin>>n>>m;
	for(int i=0;i<m;i++){
		cin>>d[i]>>t[i];
	}
	for(int i=0;i<m;i++){
		if(d[i]==1){
			type[1][i]=1;
			goto Exit1;
		}
	}
	type[1][1]=1;
	type[2][1]=1;
	type[3][1]=1;
	
Exit1:
	for(int i=1;i<=3;i++){
		if(type[i][1]!=1){
			type[i][1]=0;
		}
	}
	type[1][2]=0;
	type[2][2]=0;
	type[3][2]=0;
	for(int i=2;i<=n;i++){
		for(int j=0;j<m;j++){

			if(d[j]==i){
				type[t[j]][2]=type[t[j]][1];
				type[t[j]][1]=0;
				for(int k=1;k<=3;k++){
					if(t[j]!=k){
						for(int l=1;l<=2;l++){
						type[t[j]][1] += type[k][l];
						type[k][l]=0;
						}
					}
				}
				goto Exit2;
			}

		}
		memset(c,0,sizeof(c));
		for(int k=1;k<=3;k++){
			for(int l=1;l<=3;l++){
				if(k==l){
					c[l][2] += type[k][1];
				}
				else{
					c[l][1] += type[k][1]+type[k][2];
				}
			}
		}
		for(int k=1;k<=3;k++){
			type[k][1]=c[k][1];
			type[k][2]=c[k][2];
		}
Exit2:
		for(int j=1;j<=3;j++){
			for(int k=1;k<=2;k++){
				type[j][k]=type[j][k]%100000000;
			}
		}
	}
	cout<<(type[1][1]+type[1][2]+type[2][1]+type[2][2]+type[3][1]+type[3][2])%10000<<endl;
	return 0;
}

C++: #include <iostream>
using namespace std;

int main(){
	int n, k, a, b, ans = 0, pasta[101] = {}, dp[101][4][4] = {};
	
	cin >> n >> k;
	for(int i = 0; i < k; i++){
		cin >> a >> b;
		pasta[a] = b;
	}
	
	for(int i = 1; i <= 3; i++){
		if(pasta[1] > 0 && i != pasta[i]){
			continue;
		}
		dp[1][1][i] = 1;
	}
	
	for(int i = 2; i <= n; i++){
		for(int j = 1; j <= 3; j++){
			for(int l = 1; l <= 3; l++){
				if(pasta[i] > 0 && l != pasta[i]){
					continue;
				}
	
				dp[i][j][l] = dp[i - 1][1][j] + dp[i - 1][2][j] + dp[i - 1][3][j];

				if(i > 2 && j == l && dp[i][j][l] > 0 && dp[i - 1][j][l] > 0){
					dp[i][j][l] -= dp[i - 1][j][l];
				}
	
				dp[i][j][l] %= 10000;
			}
		}
	}
	
	for(int j = 1; j <= 3; j++){
		for(int l = 1; l <= 3; l++){
			ans += dp[n][j][l];
		}
	}
	
	cout << ans % 10000 << endl;
	
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

#define MD 10000

int main(){
	
	int dp[110][4][3]={0};
	dp[0][0][1]=1;
	/*
	dp[i][j][k]
	i日目
	jのパスタを
	k日連続使用
	*/
	
	int yo[110]={0};
	int n,k;
	cin>>n>>k;
	for(int i=0;i<k;i++){
		int d;cin>>d;
		cin>>yo[d];
	}
	
	for(int i=1;i<=n;i++){
		for(int j=1;j<=3;j++){
			if(yo[i]!=0 && yo[i]!=j)continue;
			dp[i][j][2]=dp[i-1][j][1];
			for(int j2=0;j2<=3;j2++){
				if(j2==j)continue;
				dp[i][j][1]+=dp[i-1][j2][1];
				dp[i][j][1]+=dp[i-1][j2][2];
				dp[i][j][1]%=MD;
			}
		}
	}
	
	int ans=0;
	for(int i=0;i<=3;i++){
		ans+=dp[n][i][1];
		ans+=dp[n][i][2];
		ans%=MD;
	}
	
	cout<<ans<<endl;
	
	return 0;
}

C++: #include <cstdio>
using namespace std;

int dp[101][4][4];
int schedule[101];

int main()
{
	int N, K;
	
	scanf("%d %d", &N, &K);
	
	for (int i = 0; i < K; i++){
		int A, B;
		scanf("%d %d", &A, &B);	
		schedule[A] = B;
	}
	
	dp[0][0][0] = 1;
	
	for (int i = 0; i < N; i++){
		for (int j = 0; j < 4; j++){
			for (int k = 0; k < 4; k++){
				for (int l = 1; l < 4; l++){
					if (!(j == k && k == l) && (schedule[i + 1] == 0 || schedule[i + 1] == l)){
						dp[i + 1][k][l] = (dp[i + 1][k][l] + dp[i][j][k]) % 10000;
						
						//printf("%d\n", dp[i + 1][k][l]);
					}
				}
			}
		}
	}
	
	int cnt = 0;
	
	for (int i = 1; i < 4; i++){
		for (int j = 1; j < 4; j++){
			cnt = (cnt + dp[N][i][j]) % 10000;
		}
	}
	
	printf("%d\n", cnt);
	
	return 0;
}