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 <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>

using namespace std;

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define rep1(i,x) for(int i=1;i<=(int)(x);++i)

using ll=long long;
using ld=long double;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int, int>;
using vpii=vector<pii>;

template<class T,class U>ostream&operator<<(ostream&os,const pair<T,U>p){os<<"("<<p.fst<<", "<<p.scd<<")";return os;}
template<class T>ostream&operator<<(ostream&os,const vector<T>v){rep(i,v.size()){if(i)os<<", ";os<<v[i];}return os;}
template<typename T>T&max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T&min(T&a,T&b){if(a < b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a < b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a > b){a=b;return true;}return false;}

constexpr int inf = 1e9;
constexpr ll linf = 3e18;
constexpr double eps = 1e-9;

int N, K;
int dp[105][3][3]; // dp[?????\??????][?????\???????????\???][?????\???????????\???]
int menu[105];

int main()
{
    cin >> N >> K;

    memset(menu, -1, sizeof menu);

    rep(i, K) {
        int a, b; cin >> a >> b;
        menu[a] = b - 1;
    }

    if (menu[0] != -1) {
        dp[1][menu[0]][0] = 1;
    } else {
        rep(i, 3) {
            dp[1][i][0] = 1;
        }
    }

    if (menu[1] != -1) {
        rep(i, 3) {
            dp[2][menu[1]][i] += dp[1][i][0];
        }
    } else {
        rep(i, 3) rep(j, 3) rep(k, 3) {
            dp[2][i][j] += dp[1][j][k];
            dp[2][i][j] %= 10000;
        }
    }

    for (int i = 2; i < N; ++i) {
        if (menu[i] != -1) {
            rep(j, 3) {
                rep(k, 3) {
                    if (menu[i] == j && j == k) continue;
                    dp[i + 1][menu[i]][j] += dp[i][j][k];
                    dp[i + 1][menu[i]][j] %= 10000;
                }
            }
        } else {
            rep(j, 3) {
                rep(k, 3) {
                    rep(l, 3) {
                        if (j == k && k == l) continue;
                        dp[i + 1][j][k] += dp[i][k][l];
                        dp[i + 1][j][k] %= 10000;
                    }
                }
            }
        }
    }

    int ans = 0;

    rep(i, 3) rep(j, 3) {
        ans += dp[N][i][j];
        ans %= 10000;
    }

    cout << ans << endl;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<stack>
#include<queue>
#include<functional>
#define int long long
#define INF 1e+9
#define REP(i,n) for(int i=0;i<n;i++)

using namespace std;

int dp[101][5][5];
int ps[101];

signed main() {
	int n, m;
	cin >> n >> m;
	int d, k;
	REP(i, m) {
		cin >> d >> k;
		ps[d] = k;
	}
	dp[1][ps[1]][1] = 1;
	/*else {
		dp[1][1][1] = 1;
		dp[1][2][1] = 1;
		dp[1][3][1] = 1;
	}*/
	int q, w, e;
	for (int day = 1; day <= n; day++) {
		for (int kin = 1; kin <= 3; kin++) {
			for (int i = 1; i <= 3; i++) {
				if (ps[day] == 0) {
					if (kin != 1 || ps[day + 1] != 1)dp[day][kin][1] += dp[day - 1][1][i];
					if (kin != 2 || ps[day + 1] != 2)dp[day][kin][2] += dp[day - 1][2][i];
					if (kin != 3 || ps[day + 1] != 3)dp[day][kin][3] += dp[day - 1][3][i];
				}
				else {
					if (ps[day] == 1 || (kin != 1))dp[day][1][1] += dp[day - 1][kin][i];
					else if (ps[day] == 2 || (kin != 2))dp[day][2][2] += dp[day - 1][kin][i];
					else if (ps[day] == 3 || (kin != 3))dp[day][3][3] += dp[day - 1][kin][i];
				}
				/*cout << dp[day][kin][1] << endl;
				cout << dp[day][kin][2] << endl;
				cout << dp[day][kin][3] << endl;*/
			}
		}
	}
	cout << dp[n][1][1] + dp[n][2][1] + dp[n][3][1] + dp[n][1][2] + dp[n][2][2] + dp[n][3][2] + dp[n][1][3] + dp[n][2][3] + dp[n][3][3];
	return 0;
}