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>
#define N 15
using namespace std;
int data[N][N];
void func(int,int);
int Cnt(int,int);
int X,Y,cnt,memo[N][N];
int main(){
  while(1){
    cin >> X >> Y;
    if(X==0&&Y==0) break;
    for(int i=0;i<Y;i++)
      for(int j=0;j<X;j++)
	cin >> data[i][j];
    cnt=0;
    for(int i=0;i<Y;i++)
      for(int j=0;j<X;j++)
	memo[i][j]=-1;
    for(int i=0;i<X;i++){
      if(data[0][i]==0) func(0,i);
    }
    cout << cnt << endl;
  }
  return 0;
}
void func(int y,int x){
  if(y>=Y-1){
    cnt++;
    memo[Y-1][x]=1;
    return;
  }else memo[Y-1][x]=0;
  if(y+1<Y&&x+1<X&&data[y+1][x+1]==0) func(y+1,x+1);
  if(y+1<Y&&x-1>=0&&data[y+1][x-1]==0) func(y+1,x-1);
  if(y+1<Y&&data[y+1][x]==2){
    int r=Cnt(y,x);
    if(r!=-1){
      if(memo[y+1][x]!=-1) memo[y][x]+=memo[y+1][x];
      func(r,x);
      if(memo[y+1][x]!=-1) memo[y][x]+=memo[y+1][x];
    }
    else return ;
  }
  if(y+1<Y&&data[y+1][x]==0) func(y+1,x);

}
int Cnt(int y,int x){
  y+=3;
  while(1){
    if(y>=Y-1){
      if(y>Y-1) cnt++;
      else if(y==Y-1&&data[y][x]!=1) cnt++;
      break;
    }
    if(data[y][x]==1) break;
    if(data[y][x]==2) y+=2;
    if(data[y][x]==0) return y;
  }
  return -1;
}

C++: #include<iostream>
using namespace std;
int solve(int x,int y);
int ax,ay;
int mas[20][20];
int memo[20][20];
int main(){
  while(1){
    int ans=0;
    for(int i=0;i<20;i++){
      for(int j=0;j<20;j++){
	memo[i][j]=0;
      }
    }
    cin>>ax>>ay;
    if(ax==0 && ay==0){
      break;
    }
    for(int i=0;i<ay;i++){
      for(int j=0;j<ax;j++){
	cin>>mas[i][j];
      }
    }
    for(int i=0;i<ax;i++){
      if(mas[0][i]!=1){
	ans+=solve(i,0);
      }
    }
    cout<<ans<<endl;
  }
}
int solve(int x,int y){
  if(memo[y][x]!=0){
    return memo[y][x];
  }
  else if(y==ay){
    return 1;
  }else if(mas[y][x]==1){
    return 0;
  }else if(mas[y][x]==2){
    return solve(x,y+2);
  } 
  else{
    int anss=0; 
    if(mas[y+1][x]!=1){
      memo[y+1][x]=solve(x,y+1);
      anss+=memo[y+1][x];
    }
    if(x+1<ax && mas[y+1][x+1]==0 && y+1!=ay){
      memo[y+1][x+1]=solve(x+1,y+1);
      anss+=memo[y+1][x+1];
    }
    if(0<=x-1 && mas[y+1][x-1]==0 && y+1!=ay){
      memo[y+1][x-1]=solve(x-1,y+1);
      anss+=memo[y+1][x-1];
    }
    return anss;
  }
}

C++: #include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repb(i,a,b) for(int i=a;i>=b;i--)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;


signed main() {
	int y, x;
	while (1) {
		cin >> y >> x;
		if (y + x == 0) break;
		int d[20][20] = { 0 };
		rep(i, 0, y) {
			rep(j, 0, x) {
				cin >> d[i][j];
			}
		}
		int dp[20][20] = { 0 };
		rep(i, 0, x) {
			if (d[0][i] == 0) dp[0][i] = 1;
		}
		rep(i, 0, y) {
			rep(j, 0, x) {
				if (d[i][j] == 1) continue;
				if (d[i][j] == 2 && d[i + 2][j] != 1) {
					dp[i + 2][j] += dp[i][j];
					continue;
				}
				rep(k, -1, 2) {
					if (0 <= j + k&& j + k < x && d[i + 1][j + k] == 0) {
						dp[i + 1][j + k] += dp[i][j];
					}
				}
				if (d[i + 1][j] == 2) {
					dp[i + 1][j] += dp[i][j];
				}
			}
		}
		/*cout << endl;
		rep(i, 0, y + 2) {
			rep(j, 0, x) {
				cout << dp[i][j] << " ";
			}
			cout << endl;
		}*/
		int ans = 0;
		rep(i, 0, x) {
			ans += dp[y - 1][i];
			if (d[y - 2][i] == 2) {
				ans += dp[y - 2][i];
			}
		}
		cout << ans << endl;
	}
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <cstring>
#include <fstream>
#include <numeric>
#include <algorithm>

using namespace std;

int main(int argc, char **argv) {
  int x, y, field[15 * 15], route[15 * 15], rsum;

  while (true) {
    cin >> x >> y;
    if (x == 0 && y == 0)
      break;
    rsum = 0;
    memset(route, 0, sizeof(int) * x * y);
    for (int i = 0; i < y; i++)
      for (int j = 0; j < x; j++)
        cin >> field[i * y + j];
    for (int i = 0; i < x; i++) {
      int f = field[i];
      if (!f)
        route[i] = 1;
    }

    for (int i = 1; i < y; i++)
      for (int j = 0; j < x; j++) {
        int f = field[i * y + j];
        if (f == 0) {
          for (int k = -1; k <= 1; k++)
            if ((j + k >= 0 && j + k < x) &&
                ((k == 0 && field[(i-1) * y + j+k] == 2) ||
                 (field[(i-1) * y + j+k] != 2)))
              route[i * y + j] += route[(i-1) * y + j+k];
        } else if (f == 1) {
          route[i * y + j] = 0;
        } else if (f == 2 && i + 2 < y && field[(i+2) * y + j] != 1) {
          route[(i+2) * y + j] = route[(i-1) * y + j];
        } else if (f == 2) {
          rsum += route[(i-1) * y + j];
        }
      }
    for (int i = 0; i < x; i++)
      rsum += route[(y-1) * y + i];

    cout << rsum << endl;
    /* FOR DEBUG                                                                                                                                                                                            
    for (int i = 0; i < y; i++) {                                                                                                                                                                           
      for (int j = 0; j < x; j++) {                                                                                                                                                                         
        cout << route[i * y + j];                                                                                                                                                                           
        cout << ' ';                                                                                                                                                                                        
      }                                                                                                                                                                                                     
      cout << endl;                                                                                                                                                                                         
      }*/
  }
  return 0;
}