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 pb(n) push_back(n)
#define fi first
#define se second
#define X real()
#define Y imag()
#define value(x,y,w,h) (x >= 0 && x < w && y >= 0 && y < h)
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))

typedef long long ll ;
typedef deque<int> di ;
typedef deque<ll> dl ;
typedef map<string,int> dict;
typedef complex<double> comd;
typedef pair<int,int> pii;

constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0};
const int dx[] = {0,-1,0,1};

double CalcDist(comd p1, comd p2){
  return sqrt(pow(p1.X - p2.X,2.0) + pow(p1.Y -p2.Y,2.0));
}

  template <typename T>
void out(deque < T > d)
{
  for(size_t i = 0; i < d.size(); i++)
  {
    debug(d[i]);
  }
}

template<typename T>
T ston(string& str, T n){
  istringstream sin(str) ;
  T num ;
  sin >> num ;
  return num ;
}
int N,K,a,b;
int p[110];
int dp[45][100];
int ans = 0;
int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> N >> K;
  rep(i,K){
    cin >> a >> b;
    --a;
    p[a] = b ;
  }
// 1:11 2:12 3:13 4:21 5:22 6:23 7:31 8:32 9:33
  int pasta[9] = {11,12,13,21,22,23,31,32,33};
  rep(i,9){
    if(p[0] == pasta[i] % 10){
      dp[0][i] = 1;
    }
    else if(p[0] == 0){
      dp[0][i] = 1;
    }
  }
  REP(i,0,N-1){
//     debug(p[i]);
//     REP(j,0,9){
//       scout(3) << pasta[j] ;
//       REP(i,0,N+1){
//         scout(5) << dp[i][j] << " ";
//       }
//       cout << endl;
//     }
    if(p[i+1] == 1 || p[i+1] == 0){
      dp[i+1][0] += dp[i][3] + dp[i][6];
      dp[i+1][1] += dp[i][0] + dp[i][3] + dp[i][6];
      dp[i+1][2] += dp[i][0] + dp[i][3] + dp[i][6];
    }
    if(p[i+1] == 2 || p[i+1] == 0){
      dp[i+1][3] += dp[i][1] + dp[i][4] + dp[i][7];
      dp[i+1][4] += dp[i][1] + dp[i][7];
      dp[i+1][5] += dp[i][1] + dp[i][4] + dp[i][7];
    }
    if(p[i+1] == 3 || p[i+1] == 0){
      dp[i+1][6] += dp[i][2] + dp[i][5] + dp[i][8];
      dp[i+1][7] += dp[i][2] + dp[i][5] + dp[i][8];
      dp[i+1][8] += dp[i][2] + dp[i][5];
    }
  }
  rep(i,9){
    ans += dp[N-2][i];
  }
  cout << ans % 10000 << endl;
  return 0;
}

C++: #include<cstdio>
#include<queue>
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<map>
#include<cmath>

using namespace std;

int n, k, sc[100] , dp[100][100][3];

int ans(int N, int K, int flag){
	if (dp[N][K][flag] > 0)return dp[N][K][flag];
	if (flag == 2)return 0;
	long long int ret = 0;
	if (K != sc[N] && sc[N] >= 0)return 0;
	if (N == n - 1)return 1;
	for (int i = 0; i < 3; i++){
		if (i == K)ret += ans(N + 1, i, flag + 1);
		else ret += ans(N + 1, i, 0);
	}
	return dp[N][K][flag] = ret % 10000;
}

int main(){
	int answer = 0;
	for (int i = 0; i < 100; i++){
		sc[i] = -1;
	}
	scanf("%d %d", &n, &k);
	for (int i = 0; i < k; i++){
		int a,b;
		scanf("%d %d", &a, &b);
		sc[a-1] = b-1;
	}
	for (int i = 0; i < 3; i++){
		answer += ans(0, i, 0);
		answer %= 10000;
	}
	printf("%d\n", answer);
	return 0;
}

C++: #include<iostream>
#include<cstring>
using namespace std;
int dp[100][4][4];
int plan[100],N,K;
int solve(int,int,int);
int main(){
  cin >> N >> K;
  for(int i=0,a,b;i<K;i++){
    cin >> a >> b;
    plan[a-1] = b;
  }
  memset(dp,-1,sizeof(dp));
  cout << solve(0,0,0) << endl;
}
int solve(int day,int b1,int b2){ //今日の日付,前日のPasta,前々日のPasta
  if(day == N) return 1;
  if(dp[day][b1][b2] != -1) return dp[day][b1][b2];
  if(plan[day] != 0){
   return (b1 == b2 && b1 == plan[day] ? 0 : solve(day+1,plan[day],b1)%10000);
  }
  int sum=0;
  for(int i=1;i<=3;i++){
    if(i==b1&&b1==b2)continue;
    sum += solve(day+1,i,b1) % 10000;
  }
  return dp[day][b1][b2] = sum % 10000;
}

C++: #include <iostream>
using namespace std;
long long int unco[101][4][4];
int deta[101];
int main() {
	int n, k;
	long long int unchi = 0;
	cin >> n >> k;
	for (int i = 0; i < k; i++){
		int x, y;
		cin >> x >> y;
		deta[x] = y;
	}
	unco[0][0][0] = 1;
	for(int hi = 0; hi <= n; hi++) {
		for(int one = 0; one <= 3; one++){
			for(int two = 0; two <= 3; two++) {
				if(deta[hi]) {
					if(!(deta[hi] == one && one == two)) {
						unco[hi][deta[hi]][one] += unco [hi - 1][one][two];
						unco[hi][deta[hi]][one] %= 10000;
					}
				}
				else {
					for(int l = 1; l <= 3; l++) {
						if(!(l == one && one == two)) {
							unco[hi][l][one] += unco[hi - 1][one][two];
							unco[hi][l][one] %= 10000;
						}
					}
				}
			}
		}
	}
	for(int i = 1; i<=3; i++){
		for(int j = 1; j<=3; j++){
			unchi += unco[n][i][j];
			unchi %= 10000;
		}
	}
	cout << unchi % 10000<<endl;
	return 0;
}