Go: package main

import (
	"bufio"
	"container/list"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		w, h := io.NextInt(), io.NextInt()
		if w == 0 {
			break
		}
		xWall := make([][]int, h)
		yWall := make([][]int, h)
		for i := 0; i < h; i++ {
			xWall[i], yWall[i] = make([]int, w), make([]int, w)
			for j := 0; j < w; j++ {
				xWall[i][j], yWall[i][j] = -1, -1
			}
		}
		for i := 0; i < h*2-1; i++ {
			if i%2 == 0 {
				for j := 0; j < w-1; j++ {
					xWall[i/2][j] = io.NextInt()
				}
			} else {
				for j := 0; j < w; j++ {
					yWall[i/2][j] = io.NextInt()
				}
			}
		}
		//io.Println(bfs(w, h, xWall, yWall))
		fmt.Println(bfs(w, h, xWall, yWall))
	}
}

type P struct {
	x, y int
}

func bfs(w, h int, x, y [][]int) int {
	d := make([][]int, h)
	for i := 0; i < h; i++ {
		d[i] = make([]int, w)
	}
	q := list.New()
	q.PushBack(P{0, 0})
	d[0][0] = 1

	for q.Len() != 0 {
		pos := q.Remove(q.Front()).(P)
		if pos.x == w-1 && pos.y == h-1 {
			break
		}
		if pos.x > 0 && x[pos.y][pos.x-1] == 0 && d[pos.y][pos.x-1] == 0 {
			d[pos.y][pos.x-1] = d[pos.y][pos.x] + 1
			q.PushBack(P{pos.x - 1, pos.y})
		}
		if pos.x < w-1 && x[pos.y][pos.x] == 0 && d[pos.y][pos.x+1] == 0 {
			d[pos.y][pos.x+1] = d[pos.y][pos.x] + 1
			q.PushBack(P{pos.x + 1, pos.y})
		}
		if pos.y > 0 && y[pos.y-1][pos.x] == 0 && d[pos.y-1][pos.x] == 0 {
			d[pos.y-1][pos.x] = d[pos.y][pos.x] + 1
			q.PushBack(P{pos.x, pos.y - 1})
		}
		if pos.y < h-1 && y[pos.y][pos.x] == 0 && d[pos.y+1][pos.x] == 0 {
			d[pos.y+1][pos.x] = d[pos.y][pos.x] + 1
			q.PushBack(P{pos.x, pos.y + 1})
		}
	}
	return d[h-1][w-1]
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb push_back
#define INF 999999999

int fie[40][40];
int w,h;
bool wall[33][33][4];

void bfs(int a,int b){
    bool used[40][40];
    rep(i,40)rep(j,40)used [i][j] = false;
    used[a][b]=true;
    int dy[] = {-1,0,1,0};
    int dx[] = {0,1,0,-1};
    queue<pii> que;
    que.push(pii(a,b));
    while(que.size()){
        int y=que.front().first,x=que.front().second;
        //        cout<<y<<" "<<x<<endl;
        if(y==h&&x==w)return ;
        que.pop();
        rep(i,4){
            int ddy = y+dy[i],ddx = x+dx[i];
            if(ddy<0 || ddx<0 || ddy>h || ddx>w || used[ddy][ddx])continue;
            //            cout<<i<<endl;
            if( wall[y][x][i] )continue;
            fie[ddy][ddx] = min(fie[ddy][ddx],fie[y][x]+1);
            used[ddy][ddx]=true;
            que.push(pii(ddy,ddx));
        }
    }
}


int main(){
    while(cin>>w>>h&&w&&h){
        rep(i,33)rep(j,33)rep(k,4)wall[i][j][k] = true;
        wall[0][1][2] = false;
        for(int i=1;i<=h;i++){
            for(int j=1;j<=w-1;j++){
                bool a;
                cin>>a;
                wall[i][j][1] = wall[i][j+1][3] = a;
            }
            if(i==h)continue;
            for(int j=1;j<=w;j++){
                bool a;
                cin>>a;
                wall[i][j][2] = wall[i+1][j][0] = a;
            }
        }
        rep(i,40)rep(j,40)fie[i][j] = INF;
        fie[0][1] = 0;
        bfs(0,1);
        if(fie[h][w] == INF)cout<<0<<endl;
        else cout<<fie[h][w]<<endl;
        
        //        rep(i,h+1){
        //            rep(j,w+1){
        //                printf("%3d",fie[i][j]);
        //            }
        //            cout<<endl;
        //        }
        
    }
}

C++: #include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <string>
#include <iostream>
#include <cstdlib>
#include <cstdio>
#define F(A, B) for(int A=0; A<B; A++)
using namespace std;

int w, h;
int Min;
int dir[100][100][4];
bool used[100][100];

enum COMPASS{
	NORTH=0,
	WEST,
	SOUTH,
	EAST
};

int rec(int y, int x, int sum){
	used[y][x] = true;
	if(y==h-1 && x==w-1){
		used[y][x] = false;
		if(Min > sum){
			return sum;
		}else{
			return Min;
		}
	}
	if(Min <= sum){
		used[y][x] = false;
		return Min;
	}

	if(x+1 < w && dir[y][x][EAST] == 1 && used[y][x+1] == false){
		int tmp=rec(y, x+1, sum+1);
		if(Min > tmp)Min=tmp;
	}
	if(x-1 >= 0 && dir[y][x][WEST] == 1 && used[y][x-1] == false){
		int tmp=rec(y, x-1, sum+1);
		if(Min > tmp)Min=tmp;
	}
	if(y-1 >= 0 && dir[y][x][NORTH] == 1 && used[y-1][x] == false){
		int tmp=rec(y-1, x, sum+1);
		if(Min > tmp)Min=tmp;
	}
	if(y+1 < h && dir[y][x][SOUTH] == 1 && used[y+1][x] == false){
		int tmp=rec(y+1, x, sum+1);
		if(Min > tmp)Min=tmp;
	}
	used[y][x] = false;
	return Min;
}

main(){
	while(1){
		Min=1<<30;
		cin >> w >> h;
		if(w==0)break;
		F(i, 100)F(j, 100)F(k, 4)dir[i][j][k]=0;
		F(i, h)F(j, w)used[i][j]=false;
		F(i, h){
			F(j, w-1){
				int wall;
				cin >> wall;
				if(wall == 0){
					dir[i][j][EAST] = 1;
					dir[i][j+1][WEST] = 1;
				}
			}
			if(i == h-1)break;
			F(j, w){
				int wall;
				cin >> wall;
				if(wall == 0){
					dir[i][j][SOUTH] = 1;
					dir[i+1][j][NORTH] = 1;
				}
			}
		}
		int ans = rec(0, 0, 1);
		if(ans == 1<<30)ans=0;
		cout << ans << endl;
	}
}