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<iostream>
using namespace std;

struct day
{
  int kind[4];
  int order;
  int sum;
};

int n, k;
int a[100], b[100];
day dp[101];

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

  for(int i = 0; i < k; i++)
    dp[a[i]].order = b[i];

  //day 1
  if(dp[1].order)
    dp[1].sum = dp[1].kind[dp[1].order] = 1;
  else
    for(int i = 1; i <= 3; i++)
      dp[1].sum += dp[1].kind[i] = 1;

  //day 2
  if(dp[2].order)
    dp[2].sum = dp[2].kind[dp[2].order] = dp[1].sum;
  else
    for(int i = 1; i <= 3; i++)
      dp[2].sum += dp[2].kind[i] = dp[1].sum;

  //day 3
  for(int i = 3; i <= n; i++){
    if(dp[i].order){
      if(!dp[i - 1].kind[dp[i].order])
	dp[i].sum = dp[i].kind[dp[i].order] = dp[i - 1].sum;
      else
	dp[i].sum = dp[i].kind[dp[i].order] = dp[i - 1].sum - dp[i - 1].kind[dp[i].order] + dp[i - 2].sum - dp[i - 2].kind[dp[i].order];
    }
    else{
      for(int j = 1; j <= 3; j++){
	
	if(!dp[i - 1].kind[j])
	  dp[i].sum += dp[i].kind[j] = dp[i - 1].sum;
	else
	  dp[i].sum += dp[i].kind[j] = dp[i - 1].sum - dp[i - 1].kind[j] + dp[i - 2].sum - dp[i - 2].kind[j];
      }

      dp[i].sum = (dp[i].sum + 10000) % 10000;
    }
  }

  cout << (dp[n].sum + 10000) % 10000 << endl;
  return 0;
}

C++: #include<stdio.h>
long long int dp[101][4][4];
int main(void)
{
	int n,k,a,b[101];
	int i,j,t,x,z=0;
	scanf("%d%d",&n,&k);
	for(i=1;i<=n;i++) b[i]=0;
	for(i=1;i<=k;i++){
		scanf("%d",&a);
		scanf("%d",&b[a]);
	}	
	for(i=1;i<=n;i++){
		for(j=1;j<=3;j++){
			for(t=0;t<=3;t++) dp[i][j][t]=0;
		}
	}
	if(b[1]!=0)	dp[1][b[1]][0]=1;
	else{
		for(i=1;i<=3;i++) dp[1][i][0]=1;
	}	
	for(i=1;i<n;i++){
		for(j=1;j<=3;j++){
			for(t=0;t<=3;t++){
				if(dp[i][j][t]!=0){
					if(b[i+1]!=0){
						if(j!=b[i+1]||t!=b[i+1]){
							dp[i+1][b[i+1]][j]+=dp[i][j][t];
							dp[i+1][b[i+1]][j]%=10000;
						}
					}
					else{
						for(x=1;x<=3;x++){
							if(j!=x||t!=x){
								dp[i+1][x][j]+=dp[i][j][t];
								dp[i+1][x][j]%=10000;
							}
						}
					}
				}
			}
		}
	}
	for(i=1;i<=3;i++){
		for(j=1;j<=3;j++) z+=dp[n][i][j];
	}
	z%=10000;
	printf("%d\n",z);
	return 0;
}

C++: #include<stdio.h>
int main()
{
    int n,m,dp[3][110],a,b;
    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];
            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];
                    }
                }
                if(dp[j][i - 1] == 0)
                {
                    for(int k = 0; k < 3; k++)
                    {
                        dp[j][i] = dp[j][i] - dp[k][i - 2];
                    }
                }
                else
                {
                    for(int k = 1; k < 3; k++)
                    {
                        dp[j][i] = dp[j][i] - dp[j][i - k];
                    }
                }
            }
        }
    }
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < 3; j++)
        {
            printf("%10d ",dp[j][i]);
        }
        printf("\n");
    }
    printf("%d\n",(dp[0][n - 1] + dp[1][n - 1] + dp[2][n - 1]) % 10000);
}