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 <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <complex>
#include <ctime>
#include <cstdlib>

using namespace std;

inline int to_int(string s) {int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string to_str(T x) {ostringstream sout; sout << x; return sout.str();}

typedef long long ll;

ll ans;
int plan[128];
int memo[4][128];
int num;

// n : day, next : kind of pasta, c : 今日選んだパスタが何日続いたか 
int pasta(int n, int prev, int c)
{
	if(c == 2)
	{
		return 0;
	}
	else if(n == num)
	{
		return 1;
	}
	else if(plan[n+1] != 0)
	{
		if(plan[n+1] == prev)
			return pasta(n+1, plan[n+1], c+1); 
		else
			return pasta(n+1, plan[n+1], 0);
	}
	else
	{
		int num = 0;
		for(int i = 1; i <= 3; i++)
		{
			if(prev == i)
				num += pasta(n+1, i, c+1);
			else
				num += pasta(n+1, i, 0);
		}
		return num;
	}
}

int main()
{
	int K, wk, tk;
	ans = 0;
	cin >> num >> K;
	for(int i = 0; i < K; i++)
	{
		cin >> wk >> tk;
		plan[wk] = tk;
	}
	if(plan[1] == 0)
	{
		cout << pasta(0, 0, 0) % 10000<< endl;
	}
	else
	{
		cout << pasta(1, plan[1], 0) % 10000 <<endl;
	}
}

C++: #include <iostream>
using namespace std;

enum Sauce{ NOT_DETERMINED = 0, Tomato = 1, Cream = 2, Basil = 3 };
enum Seq{ SAME, DIFF };

const int divisor = 10000;

class Pasta{
public:
	Pasta(int _N);
	~Pasta();

	void setSauce(int A, Sauce B){ sauceary[A] = B; }
	int schedule(int i, Sauce yesterday, Seq seq);

private:
	int N;
	int*** memo;
	Sauce* sauceary;
};

Pasta::Pasta(int _N){
	N = _N;
	sauceary = new Sauce[N + 1];
	memo = new int**[N + 1];

	for (int i = 0; i <= N; i++) sauceary[i] = NOT_DETERMINED;

	for (int i = 0; i <= N; i++){
		memo[i] = new int*[4];
		for (int j = 0; j < 4; j++){
			memo[i][j] = new int[2];
			memo[i][j][SAME] = -1;
			memo[i][j][DIFF] = -1;
		}
	}
}

Pasta::~Pasta(){
	delete[] sauceary;
	delete[] memo;
}

int Pasta::schedule(int i, Sauce yesterday, Seq seq){
	if (i == N + 1) return 1;
	if (memo[i][yesterday][seq] >= 0) return memo[i][yesterday][seq];

	if (seq == SAME && yesterday == sauceary[i]){
		memo[i][yesterday][SAME] = 0;
		return 0;
	}

	if (sauceary[i] == NOT_DETERMINED){
		int tmpmemo = 0;

		for (int si = 1; si <= 3; si++){
			if ((Sauce)si == yesterday && seq == SAME) continue;
			else if ((Sauce)si == yesterday && seq == DIFF) tmpmemo += schedule(i + 1, (Sauce)si, SAME) % divisor;
			else tmpmemo += schedule(i + 1, (Sauce)si, DIFF) % divisor;
		}

		memo[i][yesterday][seq] = tmpmemo % divisor;
		return memo[i][yesterday][seq];
	}
	else {
		memo[i][yesterday][seq] = schedule(i + 1, sauceary[i], (yesterday == sauceary[i] ? SAME : DIFF)) % divisor;	
		return memo[i][yesterday][seq];
	}
}

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

	Pasta* pasta = new Pasta(N);

	for (int i = 0; i < K; i++){
		int A, B;
		cin >> A >> B;
		pasta->setSauce(A, (Sauce)B);
	}

	cout << pasta->schedule(1, NOT_DETERMINED, DIFF) << endl;

	delete pasta;
	return 0;
}

C++: #include <map>
#include <vector>
#include <deque>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

map< pair< int , deque<int> > , int > memo;
int scheduled[100];
int n , m;

int f(int pos,deque<int> prev){
	deque<int> current = prev;
	if( memo.count(make_pair(pos,prev)) ) return memo[make_pair(pos,prev)];
	
	if(prev.size() == 3 && count(prev.begin(),prev.end(),prev[0]) == 3 ) return 0;
	
	if(pos == n) return 1;
	
	if(prev.size() == 3) prev.pop_front();
	
	int ans = 0;
	if(scheduled[pos] == -1){
		for(int i = 1 ; i <= 3 ; i++){
			prev.push_back(i);
			ans = ( ans + f(pos+1,prev) ) % 10000;
			prev.pop_back();
		}
	}else{
		prev.push_back(scheduled[pos]);
		ans = ( ans + f(pos+1,prev) ) % 10000;
	}
	return memo[make_pair(pos,current)] = ans;
}

int main(){
	memset(scheduled,-1,sizeof(scheduled));
	
	cin >> n >> m;
	for(int i = 0 ; i < m ; i++){
		int a,b;
		cin >> a >> b;
		a--;
		scheduled[a] = b;
	}
	cout << f(0,deque<int>()) << endl;
}

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

#define int long long

int mod = 10000;
int n, k;
int p[111] = {0};

string debug="00000000000000000000";

int dp[111][2][4];

int dfs(int i = 1, bool ff = false, int f = 0)
{
  int &ans = dp[i][ff][f];

  if (ans != -1) return ans;
  if (i == n + 1) {
    //cout << debug << endl;
    return 1;
  }
  
  if (p[i] != 0){
    if (ff && f == p[i]) return 0;
    debug[i-1] = p[i] + '0';
    ans = dfs(i + 1, f == p[i], p[i]);
    return ans %= mod;
  }

  ans = 0;
  for (int j = 1; j < 4; j++){
    if (ff && f == j) continue;
    debug[i-1] = j + '0';
    ans += dfs(i + 1, f == j, j);
  }

  return ans %= mod;
}

main()
{
  memset(dp, -1, sizeof(dp));

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

  cout << dfs() << endl;
}