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 <cstring>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
const int MAX_Y = 15;
const int MAX_X = 15;
int mx, my, c[MAX_Y][MAX_X], dp[MAX_Y][MAX_X];

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

int dfs(int y, int x) {  
  int res = 0;
  if (dp[y][x] >= 0) return dp[y][x];
  
  if (y >= my - 1) res = 1;
  
  if (c[y][x] == 2) {
    if (y + 2 >= my - 1) {
      res = 1;
    } else {
      if (c[y+2][x] != 1) res += dfs(y+2, x);
    }
  }
  
  if (res != 0) return dp[y][x] = res;
  
  rep(z,3) {
    int tx = x + dx[z], ty = y + dy[z];
    if (tx < 0 || ty < 0 || tx >= mx || ty >= my) continue;
    if (c[ty][tx] == 1) continue;
    if (c[ty][tx] == 2 && tx != x) continue;
    res += dfs(ty, tx);
  }

  return dp[y][x] = res;
}

void solve() {
  memset(dp, -1, sizeof dp);
  rep(i,my) rep(j,mx) cin>>c[i][j];

  int res = 0;
  rep(i,mx) {
    if (c[0][i] == 1) continue;
    res += dfs(0, i);
  }
  cout<<res<<endl;
}

int main (int argc, char const* argv[]) {
  while (cin>>mx>>my, mx||my) {
    solve();
  }
  return 0;
}

C++: #include <iostream> 
#define N 15
using namespace std;
void func(int,int);
int jump(int,int);
int X,Y,data[N][N],memo[N+2][N];
int main(){
  while(1){
    cin >> X >> Y;
    if(X==0&&Y==0) break;
    for(int i=0;i<Y+2;i++)
      for(int j=0;j<X;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(1){
    y+=2;
    if(data[y][x]==1) break;
    if(data[y][x]==0||y>=Y-1) return y;
  }
  return -1;
}

C++: #include<stdio.h>
#include<string.h>
#include<math.h>
int main(void)
{
	int a,s,d[20][20],f,j,i,k;
	long long int g,h[20][20];
	while(1){
		scanf("%d %d",&a,&s);
		if(a==0&&s==0) break;
		for(i=0;i<s;i++) h[0][i]=1;
		for(i=0;i<a;i++){
			for(j=0;j<s;j++) scanf("%d",&d[i][j]);
		}
		for(i=0;i<s;i++){
			if(d[0][i]==1) h[0][i]=0;
		}
		for(i=1;i<a;i++){
			for(j=0;j<s;j++) h[i][j]=0;
		}
		for(i=0;i<a;i++){
			for(j=0;j<s;j++){
				if(i!=0&&d[i+1][j]==1&&d[i][j]==2) h[i+1][j]+=h[i][j];
				if(h[i][j]!=0){
					if(d[i][j]==0) if(j!=0) if(d[i+1][j-1]==0) h[i+1][j-1]+=h[i][j];
					if(j!=s){
						if(d[i][j]==0) if(d[i+1][j+1]==0) h[i+1][j+1]+=h[i][j];
						if(d[i+1][j]==0||d[i+1][j]==2) h[i+1][j]+=h[i][j];
					}
				}
			}
		}
		g=0;
		for(j=0;j<s;j++) g+=h[a-1][j];
		/*printf("\n\n");
		for(i=0;i<a;i++){
			for(j=0;j<s;j++) printf("%d ",h[i][j]);
			printf("\n");
		}*/
		printf("%d\n",g);
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <cstring>
using namespace std;
int course[16][17][2];
int main()
{
  for(;;){
    int H,W;
    cin >> W >> H;
    if(H==0||W==0) break;
    memset(course,0,sizeof(course));
    for(int h=1; h<=H; h++){
      for(int w=1; w<=W; w++){
        cin >> course[h][w][0];
      }
    }
    for(int w=1; w<=W; w++){
      if(course[1][w][0] == 1) course[1][w][1] = 0;
      else course[1][w][1] = 1;
    }
    for(int h=2; h<=H; h++){
      for(int w=1; w<=W; w++){
        if(course[h][w][0] == 1){
          course[h][w][1] = 0;
        }else if(course[h][w][0] == 2){
          if(course[h-1][w][0] != 2){
            course[h][w][1] = course[h-1][w][1];
          }
          if(course[h-2][w][0] == 2){
            course[h][w][1] += course[h-2][w][1];
          }
        }else {
          for(int i=-1; i<=1; i++){
            if(course[h-1][w+i][0] != 2){
              course[h][w][1] += course[h-1][w+i][1];
            }
          }
          if(course[h-2][w][0] == 2){
            course[h][w][1] += course[h-2][w][1];
          }
        }
      }
    }
    long long sum = 0;
    for(int w=1; w<=W; w++){
      sum += course[H][w][1];
      if(course[H-1][w][0] == 2){
        sum += course[H-1][w][1];
      }
    }
    cout << sum << endl;
  }
  return 0;
}

C++: #include <iostream>

int main()
{
    int x, y;
    int dx[3] = {-1, 0, 1};
    
    while (std::cin >> x >> y, x, y) {
        int field[20][20] = {{0}}, dp[20][20] = {{0}};
        
        for (int i = 0; i < 20; ++i) {
            for (int j = 0; j < 20; ++j) {
                field[i][j] = 1;
            }
        }
        
        for (int i = 1; i <= y; ++i) {
            for (int j = 1; j <= x; ++j) {
                std::cin >> field[i][j];
            }
        }

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

        for (int i = 1; i <= y; ++i) {
            for (int j = 1; j <= x; ++j) {
                
                switch (field[i][j]) {
                    case 0:
                        for (int k = 0; k < 3; ++k) {
                            int px = j + dx[k], py = i + 1;
                            
                            if (field[py][px] == 2 && k == 1 || field[py][px] == 0) {
                                dp[py][px] += dp[i][j];
                            }
                        }
                        break;
                    case 2:
                        //y-1
                        if (i == y -1) ans += dp[i][j];
                        if (dp[i + 2][j] != 1) dp[i + 2][j] += dp[i][j];
                        break;
                    default:
                        break;
                }
            }
        }

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

        std::cout << ans << std::endl;
    }

    return 0;
}