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++: #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f

#include <iostream>
#include <cstdio>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#include <cctype>
#include <utility>
  
using namespace std;
  
typedef long long ll;
typedef pair <int,int> P;
typedef pair <int,P> PP;
  
static const double EPS = 1e-8;
  
static const int tx[] = {0,1,0,-1};
static const int ty[] = {-1,0,1,0};

int total_days,total_predetermined_pastas;
int predetermined_pastas[101];
int dp[101][4][4];

int dfs(int day,int pasta,int successive){
  if(successive == 3) return 0;
  if(predetermined_pastas[day] != -1
     && predetermined_pastas[day] != pasta){
    return 0;
  }
  if(dp[day][pasta][successive] != -1){
    return dp[day][pasta][successive];
  }

  if(day >= total_days){
    return 1;
  }

  int res = 0;

  if(predetermined_pastas[day+1] != -1){
    if(predetermined_pastas[day+1] == pasta){
      res = dfs(day+1,predetermined_pastas[day+1],successive+1);
    }
    else{
      res = dfs(day+1,predetermined_pastas[day+1],1);
    }
  }
  else{
    for(int next = 1; next<=3; next++){
      if(next == pasta){
	res += dfs(day+1,next,successive+1);
      }
      else{
	res += dfs(day+1,next,1);
      }
    }
  }
  return dp[day][pasta][successive] = res % 10000;
}

int main(){

  while(~scanf("%d %d",&total_days,&total_predetermined_pastas)){
    memset(predetermined_pastas,-1,sizeof(predetermined_pastas));
    for(int pasta_idx = 0; pasta_idx < total_predetermined_pastas; pasta_idx++){
      int day,type;
      scanf("%d %d",&day,&type);
      predetermined_pastas[day] = type;
    }

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

    printf("%d\n",dfs(1,predetermined_pastas[1] == -1 ? 1 : predetermined_pastas[1],1));
  }
}

C++: //AOJ 0568: Pasta
#include<iostream>
#include<algorithm>
using namespace std;
const int MAX_N = 100, INF = 10000000;
int n, k, d, p, sch[MAX_N + 1], jud, jud2;
long long int dp[MAX_N + 1][4];
int main(){
	cin >> n >> k;
	for (int i = 0; i < k; i++){
		cin >> d >> p;
		sch[d] = p;
	}
	dp[0][0] = 1;
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= 3; j++){
			if (sch[i] == j){
				dp[i][j] = dp[i - 1][0];
				jud = 0;
				jud2 = 0;
				if (i >= 3){
					if (sch[i - 1] != 0)
						jud++;
					if (sch[i - 2] != 0)
						jud++;
					if (sch[i - 1] == j)
						jud2++;
					if (sch[i - 2] == j)
						jud2++;
					if (i == 3){
						if (jud == 0){
							dp[i][j] -= 1;
						}
						if (jud == 1 && jud2 == 1){
							dp[i][j] -= 1;
						}
					}
					if (i > 3){
						if (jud == 0){
							if (j == 1)
								dp[i][1] -= dp[i - 3][2] + dp[i - 3][3];
							if (j == 2)
								dp[i][2] -= dp[i - 3][1] + dp[i - 3][3];
							if (j == 3)
								dp[i][3] -= dp[i - 3][1] + dp[i - 3][2];
						}
						if (jud == 1 && jud2 == 1){
							if (j == 1)
								dp[i][1] -= dp[i - 3][2] + dp[i - 3][3];
							if (j == 2)
								dp[i][2] -= dp[i - 3][1] + dp[i - 3][3];
							if (j == 3)
								dp[i][3] -= dp[i - 3][1] + dp[i - 3][2];
						}
					}
				}
				dp[i][0] += dp[i][j];

			}
			if (sch[i] == 0){
				dp[i][j] = dp[i - 1][0];
				jud = 0;
				jud2 = 0;
				if (i >= 3){
					if (sch[i - 1] != 0)
						jud++;
					if (sch[i - 2] != 0)
						jud++;
					if (sch[i - 1] == j)
						jud2++;
					if (sch[i - 2] == j)
						jud2++;
					if (i == 3){
						if (jud == 0){
							dp[i][j] -= 1;
						}
						if (jud == 1 && jud2 == 1){
							dp[i][j] -= 1;
						}
						if (jud2 == 2){
							dp[i][j] -= 1;
						}
					}
					if (i > 3){
						if (jud == 0){
							if (j == 1)
								dp[i][1] -= dp[i - 3][2] + dp[i - 3][3];
							if (j == 2)
								dp[i][2] -= dp[i - 3][1] + dp[i - 3][3];
							if (j == 3)
								dp[i][3] -= dp[i - 3][1] + dp[i - 3][2];
						}
						if (jud == 1 && jud2 == 1){
							if (j == 1)
								dp[i][1] -= dp[i - 3][2] + dp[i - 3][3];
							if (j == 2)
								dp[i][2] -= dp[i - 3][1] + dp[i - 3][3];
							if (j == 3)
								dp[i][3] -= dp[i - 3][1] + dp[i - 3][2];
						}
						if (jud2 == 2){
							if (j == 1)
								dp[i][1] -= dp[i - 3][2] + dp[i - 3][3];
							if (j == 2)
								dp[i][2] -= dp[i - 3][1] + dp[i - 3][3];
							if (j == 3)
								dp[i][3] -= dp[i - 3][1] + dp[i - 3][2];
						}
					}
				}
				dp[i][0] += dp[i][j];
			}
		}
		dp[i][0]=dp[i][0]%10000;
	}
	cout << dp[n][0] % 10000 << endl;
	return 0;
}