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 <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str();}
typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EACH(t,i,c) for(t::iretator i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n-1)
const double EPS = 1e-10;
const double PI = acos(-1.0);

typedef vector<vvi> vvvi;

int main() {
	int N, K;

	cin >> N >> K;
		vvvi dp(N+1, vvi(4, vi(4, 0)));
		map<int, int> info;

		REP(i, K) {
			int a, b;
			cin >> a >> b;
			info[a] = b;
		}

		if(info[1] && info[2]) {
			dp[2][info[1]][info[2]] = 1;
		} else if(info[1]) {
			FOR(i, 1, 3) {
				dp[2][info[1]][i] = 1;
			}
		} else if(info[2]) {
			FOR(i, 1, 3) {
				dp[2][i][info[2]] = 1;
			}
		} else {
		FOR(d, 1, 2) {
			FOR(i, 1, 3) {
				FOR(j, 1, 3) {
					dp[d][i][j] = 1;
				}
			}
		}
		}

		FOR(d, 3, N) {
			if(info[d]) {
				int tod = info[d];
				FOR(yes, 1, 3) {
					FOR(bef, 1, 3) {
						if(bef == yes && yes == tod) {

						} else {
							dp[d][yes][tod] += dp[d-1][bef][yes];
						}
					}
					dp[d][yes][tod] %= 10000;
				}
			} else {
				FOR(tod, 1, 3) {
					FOR(yes, 1, 3) {
						FOR(bef, 1, 3) {
							if(bef == yes && yes == tod) {

							} else {
								dp[d][yes][tod] += dp[d-1][bef][yes];
							}
						}
						dp[d][yes][tod] %= 10000;
					}
				}
			}
		}

		int ans = 0;
		FOR(i, 1, 3) {
			FOR(j, 1, 3) {
				ans += dp[N][i][j];
			}
		}

		cout << ans%10000 << endl;

	return 0;
}

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

using namespace std;

int solve(int,int,int);

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

int main(){
	cin >> n >> k;
	
	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 <sstream>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <vector>
#include <cmath>
#include <string>
#include <cstring>

using namespace std;

#define int long long
#define LL long long
#define ULL unsigned long long

const LL LL_INF = ~(ULL)0 >> 1;

int day[105] = {0}, n, k, mem[101][4][4][4];

int f(int d, int src, int presrc, int num) {
    if (d == n) {
        return (num + 1) % 10000;
    }

    if (day[d + 1] != 0) {
        return f(d + 1, day[d + 1], src, num);
    }

    int result = num;
    for (int i = 1; i <= 3; ++i) {
        int ptemp[] = {presrc, src, i, day[d + 2], day[d + 3]}, pre = 0, isoverlap = false;
        for (int j = 0, count = 0; j < 5; ++j) {
            if (pre == ptemp[j]) {
                count++;
                if (count == 3) {
                    isoverlap = true;
                    break;
                }
            } else {
                pre = ptemp[j];
                count = 1;
            }
        }
        if (isoverlap) continue;

        int temp = (mem[d + 1][i][src][presrc] == LL_INF) ? f(d + 1, i, src, 0) : mem[d + 1][i][src][presrc];
        mem[d + 1][i][src][presrc] = temp;
        result = (result + temp) % 10000;
    }

    return result;
}

signed main() {
    for (int i = 0; i < 101; ++i) {
        for (int j = 0; j < 4; ++j) {
            for (int k = 0; k < 4; ++k) {
                fill(mem[i][j][k], mem[i][j][k] + 4, LL_INF);
            }
        }
    }
    cin >> n >> k;

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

    int result = 0;

    if (day[1] == 0) {
        for (int i = 1; i <= 3; ++i) {
            result = (result + f(1, i, 0, 0)) % 10000;
        }
    } else {
        result = (result + f(1, day[1], 0, 0)) % 10000;
    }

    cout << result << endl;

    return 0;
}