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<bits/stdc++.h>
using namespace std;

//#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
typedef vector<int>vint;
typedef pair<int,int>pint;

const int mod=10000;

int N,K;
int lis[100];

int dp[101][3][3];

signed main(){
    cin>>N>>K;
    memset(lis,-1,sizeof(lis));
    rep(i,K){
        int a,b;
        cin>>a>>b;
        lis[--a]=--b;
    }

    rep(i,3)rep(j,3){
        if(lis[0]!=-1&&lis[0]!=i)continue;
        if(lis[1]!=-1&&lis[1]!=j)continue;
        dp[2][i][j]=1;
    }

    reps(i,2,N)rep(j,3)rep(k,3)rep(l,3){
        if(j==k&&k==l)continue;
        if(lis[i]!=-1&&lis[i]!=l)continue;
        dp[i+1][k][l]=(dp[i+1][k][l]+dp[i][j][k])%mod;
    }

    int ans=0;
    rep(i,3)rep(j,3)ans=(ans+dp[N][i][j])%mod;
    cout<<ans<<endl;
    return 0;
}

C++: #include <bits/stdc++.h>

#define LL long long
#define VI vector<int>
#define VVI vector<vector<int>>
#define VVVI vector<vector<vector<int>>>
#define VL vector<LL>
#define VVL vector<vector<LL>>
#define VVVL vector<vector<vector<LL>>>
#define VB vector<bool>
#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EPS 1e-14

template<class T> T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> void print(T x) { std::cout << x << std::endl; }

const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy = { 0, -1, 0, 1 }, dx = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）

using namespace std;

const int MOD = 10000;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N, K;
    cin >> N >> K;
    map<int, int> m;
    FOR(i, 0, K) {
        int a, b;
        cin >> a >> b;
        m[a] = b;
    }

    // dp[i][j][k] = i日目に2日前がパスタjで1日前がパスタkのときの場合の数
    VVVL dp(N + 1, VVL(4, VL(4, 0)));
    if (m[1]) {
        dp[1][0][m[1]] = 1;
    }
    else {
        dp[1][0][1] = 1;
        dp[1][0][2] = 1;
        dp[1][0][3] = 1;
    }

    FOR(i, 1, N) {
        FOR(j, 1, 4) {
            FOR(k, 1, 4) {

                // i + 1日目のパスタが指定されてる
                if (m[i + 1]) {
                    if (j == k and k == m[i + 1]) {

                    }
                    else {
                        (dp[i + 1][k][m[i + 1]] += dp[i][j][k]) %= MOD;
                    }
                    continue;
                }

                // 2日連続で同じパスタ
                if (j == k) {
                    if (j == 1) {
                        (dp[i + 1][k][2] += dp[i][j][k]) %= MOD;
                        (dp[i + 1][k][3] += dp[i][j][k]) %= MOD;
                    }
                    else if (j == 2) {
                        (dp[i + 1][k][1] += dp[i][j][k]) %= MOD;
                        (dp[i + 1][k][3] += dp[i][j][k]) %= MOD;
                    }
                    else if (j == 3) {
                        (dp[i + 1][k][1] += dp[i][j][k]) %= MOD;
                        (dp[i + 1][k][2] += dp[i][j][k]) %= MOD;
                    }

                }
                else {
                    (dp[i + 1][k][1] += dp[i][j][k]) %= MOD;
                    (dp[i + 1][k][2] += dp[i][j][k]) %= MOD;
                    (dp[i + 1][k][3] += dp[i][j][k]) %= MOD;
                }
            }
        }
    }

    LL ans = 0;
    FOR(j, 1, 4) {
        FOR(k, 1, 4) {
            (ans += dp[N][j][k]) %= MOD;
        }
    }
    print(ans % MOD);
}

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

const int mod = 10000;

int main(){
  int n,k;
  cin >> n >> k;
  vector<int> c(n,-1);
  for(int i=0;i<k;i++){
    int a,b;
    cin >> a >> b; a--;
    c[a] = b;
  }
  
  int dp[110][5][5] = {};
  dp[0][0][0] = 1;

  for(int d=0;d<n;d++){
    for(int i=0;i<=3;i++){
      for(int j=0;j<=3;j++){
	for(int k=1;k<=3;k++){
	  if(c[d]>=0 && c[d]!=k)continue;
	  if(i==k && j==k)continue;
	  (dp[d+1][j][k] += dp[d][i][j]) %= mod;
	}
      }
    }
  }

  int ans = 0;
  for(int i=0;i<=3;i++){
    for(int j=0;j<=3;j++){
      (ans += dp[n][i][j]) %= mod;;
    }
  }
  cout << ans << endl;
}