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[40][40][40][40];

void bfs(int a,int b){
    bool used[40][40];
    rep(i,40)rep(j,40)used [i][j] = false;
    int dx[] = {-1,0,1,0};
    int dy[] = {0,1,0,-1};
    queue<pii> que;
    que.push(pii(a,b));
    while(que.size()){
        int y=que.front().first,x=que.front().second;
        used[y][x] = true;
        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;
            if(wall[y][x][ddy][ddx])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,40)rep(j,40)rep(k,40)rep(l,40)wall[i][j][k][l] = true;
        wall[0][1][1][1] = false;
        wall[h][w][h+1][w]=false;
        for(int i=1;i<=h;i++){
            for(int j=1;j<=w-1;j++){
                cin>>wall[i][j][i][j+1];
                wall[i][j+1][i][j] = wall[i][j][i][j+1];
            }
            if(i==h)continue;
            for(int j=1;j<=w;j++){
                cin>>wall[i][j][i+1][j];
                wall[i+1][j][i][j] = wall[i][j][i+1][j];
            }
        }
        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;
        
    }
}

C++: #include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;

//?????????Memory Limit Exceeded????????£???????????????
//????????????????????£??????

//?????????
//queue??§?????????????????????visited=1
//??¨??????field=min(?????????field,??????field+1)
//??¨??????visited=0??????queue?????\?????????

//??¨???
//field[y][x]


int main(void){
	int w,h,field[30][30],visited[30][30],wall[61][30],ans[100],cnt=0,x,y;
	while(1){
		queue<pair<int,int> > Q;
		cin>>w>>h;
		if(w==0 && h==0)break;
		rep(i,h){
			rep(j,w){
				field[i][j]=10000;//?????¢????????????
				visited[i][j]=0;//?¨????????????????
			}
		}
		rep(i,h*2-1){
			if(i%2==0){
				rep(j,w-1)cin>>wall[i][j];
			}else if(i%2==1){
				rep(j,w)cin>>wall[i][j];
			}
		}

		//(0,0)???queue?????????
		//??????????°?????????????queue?????????????????\???????????????????????????????????????
		Q.push(make_pair(0,0));
		field[0][0]=1;

		while(!Q.empty()){
			pair<int,int> p = Q.front();
			Q.pop();
			x = p.first;
			y = p.second;
			visited[y][x]=1;
			//???????????????????????????????????????
			if(x>0 && wall[2*y][x-1]==0){//???
				if(visited[y][x-1]==0){
					Q.push(make_pair(x-1,y));
				}
				if(field[y][x-1]>field[y][x]+1)field[y][x-1]=field[y][x]+1;
			}
			if(x<w-1 && wall[2*y][x]==0){//???
				if(visited[y][x+1]==0){
					Q.push(make_pair(x+1,y));
				}
				if(field[y][x+1]>field[y][x]+1)field[y][x+1]=field[y][x]+1;
			}
			if(y>0 && wall[2*y-1][x]==0){//???
				if(visited[y-1][x]==0){
					Q.push(make_pair(x,y-1));
				}
				if(field[y-1][x]>field[y][x]+1)field[y-1][x]=field[y][x]+1;
			}
			if(y<h-1 && wall[2*y+1][x]==0){//???
				if(visited[y+1][x]==0){
					Q.push(make_pair(x,y+1));
				}
				if(field[y+1][x]>field[y][x]+1)field[y+1][x]=field[y][x]+1;
			}
		}
		if(visited[h-1][w-1]==1){
			ans[cnt]=field[h-1][w-1];
		}else{
			ans[cnt]=0;
		}
		cnt++;
	}
	rep(i,cnt)cout<<ans[i]<<endl;
	return 0;
}