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>
using namespace std;
int n,k,total,a,b;
int menu[101],t[101][4][3],ans[101];
int ot(int a){
  if(a>3)a-=3;
  return a;
}
int main(){
  cin>>n>>k;
  for(int i=0;i<=100;i++){
    menu[i]=0;
    for(int j=0;j<4;j++){
      for(int k=0;k<3;k++){
	t[i][j][k]=0;
      }
    }
  }

  for(int i=0;i<k;i++){
    cin>>a>>b;
    menu[a]=b;
  }

  if(menu[1]==0){
    ans[1]=3;
    t[1][1][1]=t[1][2][1]=t[1][3][1]=1;
    t[1][1][0]=t[1][2][0]=t[1][3][0]=2;
  }else{
    t[1][menu[1]][1]=1;
    t[1][ot(menu[1]+1)][0]=1;
    t[1][ot(menu[1]+2)][0]=1;
    ans[1]=1;
  }
  for(int i=2;i<=n;i++){
    if(menu[i]==0){
      ans[i]=ans[i-1]*3;
      ans[i]-=t[i-1][1][2]+t[i-1][2][2]+t[i-1][3][2];
      t[i][1][2]=t[i-1][1][1];
      t[i][1][1]=t[i-1][1][0];
      t[i][1][0]=ans[i]-t[i][1][2]-t[i][1][1];

      t[i][2][2]=t[i-1][2][1];
      t[i][2][1]=t[i-1][2][0];
      t[i][2][0]=ans[i]-t[i][2][2]-t[i][2][1];

      t[i][3][2]=t[i-1][3][1];
      t[i][3][1]=t[i-1][3][0];
      t[i][3][0]=ans[i]-t[i][3][2]-t[i][3][1];

    }else{
      ans[i]=ans[i-1]-t[i-1][menu[i]][2];
      t[i][menu[i]][2]=t[i-1][menu[i]][1];
      t[i][menu[i]][1]=t[i-1][menu[i]][0];
      t[i][menu[i]][0]=0;
      t[i][ot(menu[i]+1)][0]=ans[i];
      t[i][ot(menu[i]+2)][0]=ans[i];
      t[i][ot(menu[i]+1)][1]=0;
      t[i][ot(menu[i]+2)][1]=0;
      t[i][ot(menu[i]+1)][2]=0;
      t[i][ot(menu[i]+2)][2]=0;
    }
  }
  cout<<ans[n]%10000<<endl;
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <climits>
#include <string>
#include <vector>
#include <cmath>
using namespace std;

#define MOD 10000

int N, K;
int dp[110][3][3];
int P[110];

int main() {
  cin >> N >> K;
  for (int i=0; i<N; i++) P[i] = -1;
  for (int i=0; i<K; i++) {
    int a, b;
    cin >> a >> b;
    P[a-1] = b-1;
  }
  dp[0][0][0] = 1;
  for (int i=0; i<N; i++) {
    for (int j=0; j<3; j++) {
      for (int k=0; k<3; k++) {
        for (int n=0; n<3; n++) {
          if (i >= 2 && n == j && j == k) continue;
          if (P[i] != -1 && P[i] != n) continue;
          dp[i+1][n][j] = (dp[i+1][n][j] + dp[i][j][k]) % MOD;
        }
      }
    }
  }
  int ans = 0;
  for (int j=0; j<3; j++) {
    for (int k=0; k<3; k++) {
      ans += dp[N][j][k];
      ans %= MOD;
    }
  }
  cout << ans << "\n";
  return 0;
}

C++: #include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=1;i<=n;i++)
#define drep(i,n) for(int i=n;i>=0;i--)
#define INF 100000005
#define MAX 100000001
#define dmp make_pair
#define dpb push_back
#define fi first
#define se second
using namespace std;
//__gcd(a,b), __builtin_popcount(a);

int a[101], dp[101][3][3];
int main(){
	int n, k,t1,t2;
	scanf("%d%d", &n, &k);
	rep(i,k){
		scanf("%d%d", &t1, &t2);
		a[t1] = t2;
	}
	if(a[1] == 0 || a[1] == 1)dp[1][0][1] = 1;
	if(a[1] == 0 || a[1] == 2)dp[1][1][2] = 1;
	if(a[1] == 0 || a[1] == 3)dp[1][2][0] = 1;
	for(int i = 1;i <= n;i++){
		if(a[i] == 0 || a[i] == 1){
			dp[i][0][0] = dp[i-1][0][1]+dp[i-1][0][2];
			rep(j,3)dp[i][0][1] += dp[i-1][1][j];
			rep(j,3)dp[i][0][2] += dp[i-1][2][j];
		}
		if(a[i] == 0 || a[i] == 2){
			dp[i][1][1] = dp[i-1][1][0]+dp[i-1][1][2];
			rep(j,3)dp[i][1][0] += dp[i-1][0][j];
			rep(j,3)dp[i][1][2] += dp[i-1][2][j];
		}
		if(a[i] == 0 || a[i] == 3){
			dp[i][2][2] = dp[i-1][2][0]+dp[i-1][2][1];
			rep(j,3)dp[i][2][0] += dp[i-1][0][j];
			rep(j,3)dp[i][2][1] += dp[i-1][1][j];
		}
		rep(j,3)rep(k,3)dp[i][j][k] = dp[i][j][k]%10000;
	}
	int ans = 0;
	rep(i,3)rep(j,3)ans += dp[n][i][j];
	printf("%d\n", ans);
	return 0;
}