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 <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

typedef long long LL;
template<typename T> using V = std::vector<T>;
template<typename T> using VV = std::vector<std::vector<T>>;
template<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;

template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }

const int INF = 1L << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;


int main() {
    cin.tie(0);
	ios::sync_with_stdio(false);

    while (true) {
        int X, Y;
        cin >> X >> Y;
        if (X == 0 or Y == 0) {
            break;
        }

        vector<vector<int>> f(Y, vector<int>(X));
        FOR(y, 0, Y) {
            FOR(x, 0, X) {
                cin >> f[y][x];
            }
        }

        vector<vector<int>> dp(Y, vector<int>(X));
        FOR(x, 0, X) {
            if (f[0][x] == 0) {
                dp[0][x] = 1;
            }
        }

        FOR(y, 0, Y - 1) {
            FOR(x, 0, X) {
                if (f[y][x] == 0) {
                    if (x - 1 >= 0 and f[y + 1][x - 1] != 1 and f[y + 1][x - 1] != 2) {
                        dp[y + 1][x - 1] += dp[y][x];
                    }
                    if (f[y + 1][x] != 1) {
                        dp[y + 1][x] += dp[y][x];
                    }
                    if (x + 1 < f[0].size() and f[y + 1][x + 1] != 1 and f[y + 1][x + 1] != 2) {
                        dp[y + 1][x + 1] += dp[y][x];
                    }
                }
                else if (f[y][x] == 1) {

                }
                else if (f[y][x] == 2) {
                    if (y + 2 < f.size()) {
                        if (f[y + 2][x] != 1) {
                            dp[y + 2][x] += dp[y][x];
                        }
                    }
                    else {
                        dp[y + 1][x] += dp[y][x];
                    }
                }
            }
        }

        LL ans = 0;
        FOR(x, 0, X) {
            ans += dp[Y - 1][x];
        }
        print(ans);
    }

	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

int main()
{
	int X, Y;
	while(cin >> X >> Y && X)
	{
		vector<vint> field(Y, vint(X, 0)), dp(Y, vint(X, 0));
		rep(y, Y) rep(x, X)
			cin >> field[y][x];

		rep(x, X)
			dp[0][x] = !field[0][x];

		REP(y, 1, Y) rep(x, X)
		{
			if(field[y][x] == 1) continue;

			if(1 < y && field[y - 2][x] == 2) dp[y][x] = dp[y - 2][x];

			if(field[y][x] == 0)
			{
				int dx[] = {-1, 0, 1};
				rep(i, 3)
				{
					int nx = x + dx[i];
					if(0 <= nx && nx < X && field[y - 1][nx] != 2)
						dp[y][x] += dp[y - 1][nx];
				}
			}
			else
			{
				dp[y][x] += dp[y - 1][x];
			}
		}

		int res = accumulate(ALL(dp[Y-1]), 0);
		rep(x, X)
			res += field[Y-2][x] == 2 ? dp[Y-2][x] : 0;
		cout << res << endl;
	}
}

C++: #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[18][18];
int kosu[18][18];
int ans;

int main(){
  int x,y;
  
  while(1){
    cin>>x>>y;
    if(x==0 && y==0) break;
    
    fill(dp[0],dp[18],0);
    fill(kosu[0],kosu[18],0);
    ans=0;
    
    for(int i=0;i<y;i++){
      for(int l=0;l<x;l++){
        cin>>kosu[i][l];
      }
    }
    for(int i=0;i<x;i++)
      if(kosu[0][i]==0) dp[0][i]=1;
    
    for(int i=0;i<y;i++){
      for(int l=0;l<x;l++){
        
        if(kosu[i][l]==2 && kosu[i+2][l]!=1){
          dp[i+2][l]+=dp[i][l];
          //dp[i][l]=0;
        }
        if(kosu[i][l]==0 && i < y - 1)
          for(int z=-1;z<2;z++)
            if(l+z >= 0 && l+z < x && (z==0 || kosu[i+1][l+z]==0)) 
            	dp[i+1][l+z]+=dp[i][l];
        if(kosu[i][l]==0 && i == y - 1) dp[y][l] += dp[y-1][l];
      }
    }
    for(int i=y;i<y+2;i++){
      for(int l=0;l<x;l++){
        ans+=dp[i][l];
      }
    }
    
    /*for(int i=0;i<y+2;i++){
	for(int j=0;j<x;j++) cout << dp[i][j] << ' ';
	cout << endl;
    }*/
    
    printf("%d\n",ans);
  }
  return 0;
}