Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
	)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		X, _ := strconv.Atoi(buf[0])
		Y, _ := strconv.Atoi(buf[1])
		if X == 0 && Y == 0 {
			break
		}
		tbl := make([][]int, Y+2)
		field := make([][]int, Y+2)
		for i := range field {
			field[i] = make([]int, X+2)
			tbl[i] = make([]int, X+2)
			for j := range field[i] {
				field[i][j] = 2
				tbl[i][j] = 0
			}
		}
		buf_ := make([][]string, Y)
		for i := range buf_ {
			scanner.Scan()
			buf_[i] = strings.Split(scanner.Text(), " ")
		}
		for i := 1; i <= Y; i++ {
			for j := 1; j <= X; j++ {
				field[i][j], _ = strconv.Atoi(buf_[i-1][j-1])
				switch field[i][j] {
				case 0:
					if i == 1 {
						tbl[i][j] = 1 // スタートy=1
					} else {
						if field[i-1][j-1] != 2 {
							tbl[i][j] += tbl[i-1][j-1] // 左上からやってくる
						}
						if field[i-1][j] != 2 {
							tbl[i][j] += tbl[i-1][j] // 真上からやってくる
						}
						if field[i-1][j+1] != 2 {
							tbl[i][j] += tbl[i-1][j+1] // 右上からやってくる
						}
						if field[i-2][j] == 2 {
							tbl[i][j] += tbl[i-2][j] // ジャンプしてくる
						}
					}
				case 1:
					tbl[i][j] = 0 // 障害物あり
				case 2:
					if field[i-1][j] != 2 {
						tbl[i][j] += tbl[i-1][j] // 真上からくる
					}
					if field[i-2][j] == 2 {
						tbl[i][j] += tbl[i-2][j] // ジャンプ台からジャンプしてくる
					}
				}
			}
		}
		sum := 0
		for i := 1; i <= X; i++ {
			sum += tbl[Y][i] // とびこさないでゴール
			if field[Y-1][i] == 2 {
				sum += tbl[Y-1][i] // 飛び越してゴール
			}
		}
		fmt.Println(sum)
	}
}

C++: #include <iostream>
#include <algorithm>

using namespace std;

int dy[] = { 1, 1, 1};
int dx[] = { -1, 0, 1 };

int main() {
    while (1) {
        int dp[17][15] = { 0 };
        int field[15][15] = { 0 };
        int h, w;

        cin >> w >> h;
        if (w == 0) {
            break;
        }
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                cin >> field[i][j];
            }
        }
        
        for (int j = 0; j < w; j++) {
            if (field[0][j] == 0) {
            dp[0][j] = 1;
            }
        }
        
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                if (dp[i][j] > 0) {
                    if (i == h - 1) {
                        dp[i + 1][j] += dp[i][j];
                        continue;
                    }
                    if (field[i][j] == 2) {
                        if (field[i + 2][j] == 0 || field[i + 2][j] == 2) {
                            dp[i + 2][j] += dp[i][j];
                        }
                        continue;
                    }
                    for (int k = 0; k < 3; k++) {
                        int nx = j + dx[k];
                        int ny = i + dy[k];
                        if (nx < 0 || nx >= w) {
                            continue;
                        }
                        if (field[ny][nx] == 0 || (field[ny][nx] == 2 && k == 1)) {
                            dp[ny][nx] += dp[i][j];
                        }
                    }
                }
            }
        }
        
        int ans = 0;
        for (int j = 0; j < w; j++) {
            ans += dp[h][j];
        }
        cout << ans << endl;
    }
    
    return 0;
}

C++: #include <iostream>
#define N 20
using namespace std;
void func(int,int);
int jump(int,int);
int X,Y,data[N][N],memo[N][N];
int main(){
  while(1){
    cin >> X >> Y;
    if(X==0&&Y==0) break;
    for(int i=0;i<N;i++)
      for(int j=0;j<N;j++) data[i][j]=0,memo[i][j]=0;

    for(int i=0;i<Y;i++)
      for(int j=0;j<X;j++) cin >> data[i][j];

    for(int i=0;i<X;i++)
      if(data[0][i]!=1) func(0,i);

    int cnt=0;
    for(int i=0;i<X;i++) cnt+=memo[0][i];
    cout << cnt << endl;
  }
  return 0;
}
void func(int y,int x){
  if(y>=Y-1){
    memo[y][x]=memo[Y][x]=memo[Y-1][x]=1;
    return ;
  }
  if(0<=x-1&&data[y+1][x-1]==0){
    if(memo[y+1][x-1]==0) func(y+1,x-1);
    memo[y][x]+=memo[y+1][x-1];
  }
  if(x+1<X&&data[y+1][x+1]==0){
    if(memo[y+1][x+1]==0) func(y+1,x+1);
    memo[y][x]+=memo[y+1][x+1];
  }
  if(data[y+1][x]==0){
    if(memo[y+1][x]==0) func(y+1,x);
    memo[y][x]+=memo[y+1][x];
  }
  if(data[y+1][x]==2){
    int r=jump(y+1,x);
    if(r!=-1){
      if(memo[r][x]==0) func(r,x);
      memo[y][x]+=memo[r][x];
    }else data[y+1][x]=1;
  }
  if(memo[y][x]==0) data[y][x]=1;
}
int jump(int y,int x){
  while(data[y][x]==2)y+=2;
  if(data[y][x]==0||y>=Y-1) return y;
  return -1;
}

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

int main(){

  int x, y;
  while( cin >> x >> y, x+y ) {
    int field[16][16];
    int dp[16][16]={{0}};
    for(int i=0; i<y; i++) {
      for(int j=0; j<x; j++) {
	cin >> field[i][j];
      }
    }

    for(int i=0; i<x; i++) {
      if( field[0][i] != 1 ) dp[0][i] = 1;
    }


    for(int i=0; i<y-1; i++) {
      for(int j=0; j<x; j++) {
	if( field[i][j] == 1 ) continue;

	else if( field[i][j] == 2 ) {
	  if( field[i+2][j] != 1 ) {
	    dp[min(y-1, i+2)][j] += dp[i][j];
	  }
	}

	else {
	  if( j ) {
	    if( field[i+1][j-1] == 0 ) dp[i+1][j-1] += dp[i][j];
	  }
	  if( j < x-1 ) {
	    if( field[i+1][j+1] == 0 ) dp[i+1][j+1] += dp[i][j];
	  }
	  if( field[i+1][j] != 1 ) dp[i+1][j] += dp[i][j];
	}
      }
    }

    int sum = 0;
    for(int i=0; i<x; i++) {
      sum += dp[y-1][i];
    }

    cout << sum << endl;
  }
}

C++: #include <iostream>
using namespace std;
int X,Y;
int fields[20][20];
int dp[20][20];
int counter=0;
int Max(int x,int y){
        return x>y?x:y;
}
int Min(int x,int y){
        return x>y?y:x;
}
int recursion(int y,int x){
        int res=0;
        if(dp[y][x]!=-1)
                return dp[y][x];
        else if(fields[y][x]==3)
                res=0;
        else if(fields[y][x]==2){
                if(fields[y+2][x]==1)
                        return 0;
                res+=recursion(y+2,x);
        }
        else{
                if(fields[y+1][x]!=1){
                        res+=recursion(y+1,x);
                }
                if(fields[y+1][x-1]==0){
                        res+=recursion(y+1,x-1);
                }
                if(fields[y+1][x+1]==0){
                        res+=recursion(y+1,x+1);
                }
        }
        return dp[y][x]=res;
}
int main(){
        while(true){
                for(int i=0 ; i<20 ; i++ )
                        for(int j=0 ; j<20 ; j++ )
                                dp[i][j]=-1;
                cin >> X >> Y;
                counter=0;
                if(X+Y==0)
                        break;
                for(int i=0 ; i<=X ; i++ ){
                        fields[0][i]=3;
                        fields[Y+1][i]=3;
                }
                for(int i=0 ; i<=Y ; i++ ){
                        fields[i][0]=3;
                        fields[i][X+1]=3;
                }
                for(int i=1 ; i<=Y ; i++ )
                        for(int j=1 ; j<=X ; j++ )
                                cin >> fields[i][j];
                int ans=0;
                for(int i=1 ; i<=X ; i++ ){
                        if(fields[1][i]==1)
                                continue;
                        ans+=recursion(1,i);
                }
                cout << ans << endl;
        }
        return 0;
}