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++: //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]%10000;

			}
			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]%10000;
			}
		}
	}
	cout << dp[n][0] % 10000 << endl;
	return 0;
}

C++: #include<stdio.h>
int main()
{
    int n,m,dp[3][110],a,b,ans;
    scanf("%d%d",&n,&m);
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < 3; j++)
        {
            dp[j][i] = -1;
        }
    }
    for(int i = 0; i < m; i++)
    {
        scanf("%d%d",&a,&b);
        for(int j = 0; j < 3; j++)
        {
            if(j == b - 1);
            else dp[j][a - 1] = 0;
        }
    }
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < 3; j++)
        {

            if(dp[j][i] == 0);
            else if(i == 0)dp[j][i] = 1;
            else if(i == 1)dp[j][i] = (dp[0][i - 1] + dp[1][i - 1] + dp[2][i - 1]) % 10000;
            else
            {
                dp[j][i] = 0;
                for(int k = 0; k < 3; k++)
                {
                    for(int l = 1; l < 3; l++)
                    {
                        dp[j][i] = (dp[j][i] + dp[k][i - l]) % 10000;
                    }
                }
                if(dp[j][i - 1] == 0)
                {
                    for(int k = 0; k < 3; k++)
                    {
                        dp[j][i] = (dp[j][i] - dp[k][i - 2]) % 10000;
                    }
                }
                else
                {
                    for(int k = 1; k < 3; k++)
                    {
                        dp[j][i] = (dp[j][i] - dp[j][i - k]) % 10000;
                    }
                }
            }
        }
    }
    ans = (dp[0][n - 1] + dp[1][n - 1] + dp[2][n - 1]) % 10000;
    if(ans < 0)ans = 10000 + ans;
    printf("%d\n",ans);
    return 0;
}