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<iostream>
#include<cstdio>
#include<string>
#include<queue>

using namespace std;
int bfs(int x,int y);
int w,h;
int i,j;
int dy[4] = {1,0,-1,0}, dx[4] = {0,-1,0,1};
string map[100];
int dis[100][100];
queue<pair<int,int> > q;
int main(){
  while(1){
    cin >> w >> h;
    if(w == 0 && h == 0) break;
    w = 2*w -1;
    h = 2*h -1;
    cin.ignore();
    for(i = 0;i < h;i++){
      getline(cin,map[i]);
    }
    bfs(0,0);
    //cout << dis[4][2] +1<<endl;
    if(dis[h-1][w-1] > 0){
    cout << dis[h-1][w-1] +1<<endl;
    }else{
      cout << 0 <<endl;
    }
  }
  return 0;
}

int bfs(int x,int y){
  int k;
  //cout << "x = "<<x<<endl;
  //cout << "y = "<<y<<endl;
  pair<int,int> tmp;
  for(k = 0;k < 4;k++){
    if(y +  2*dy[k] >-1 && y + 2*dy[k] < h && x + 2*dx[k] < w && x + 2*dx[k] > -1){
      // cout << "dx = "<<dx[k]<<endl;
      //cout << "dy = "<<dy[k]<<endl;
      if(map[y + dy[k]][x + dx[k]] == '0'){
	map[y + dy[k]][x + dx[k]] ='1';
	tmp.second = x + 2*dx[k];
	tmp.first = y +2*dy[k];
	q.push(tmp);
	dis[y + 2*dy[k]][x + 2*dx[k]] = dis[y][x] + 1;
	//cout << dis[y + 2*dy[k]][x + 2*dx[k]]<<endl;
      }
    }
  }
  while(q.size() != 0){
    tmp = q.front();
    q.pop();
    bfs(tmp.second,tmp.first);
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int x[900][900],h,w,a,y[900],s;
queue<int>Q,R;
int main(){
	while(true){
		memset(x,0,sizeof(x));
		memset(y,0,3600);
		cin>>w>>h;
		if(!w){break;}
		for(int i=0;i<h*2-1;i++){
			if(i%2==1){
				for(int j=0;j<w;j++){
					cin>>a;
					if(!a){
						x[(i/2)*30+j][(i/2+1)*30+j]=1;
					}
				}
			}
			else{
				for(int j=0;j<w-1;j++){
					cin>>a;
					if(a==0){
						x[(i/2)*30+j][(i/2)*30+j+1]=1;
					}
				}
			}
		}
		Q.push(0);
		s=1;
		y[0]=1;
    	while(y[(h-1)*30+(w-1)]==0){
			while(!Q.empty()){
				a=Q.front();
				for(int j=0;j<900;j++){
					if((x[a][j]==1||x[j][a]==1)&&y[j]==0){
						y[j]=1;
						R.push(j);
					}
				}
				Q.pop();
			}
			while(!R.empty()){
				Q.push(R.front());
				R.pop();
			}
			s++;
			if(s>=1000){s=0;break;}
		}
		while(!Q.empty()){
			Q.pop();
		}
		cout<<s<<endl;
	}
}

C++: #include<iostream>
#include<queue>
using namespace std;


	

int main(){
	
	int a,b,i,j,x,y;
	int meiro[100][100];
	int map[100][100];
	queue<int> que;
	
	while(1){
	
		
		cin >> a >> b ;
		
		if(a==0&&b==0) break;
		
		
		for(i=0;i<100;i++){
			for(j=0;j<100;j++){
				map[i][j] = 0;
				meiro[i][j]=1;
			}
		}
		
		
		for(i=0;i<2*b-1;i++){
			
			if(i%2 == 0){
				for(j=0;j<a-1;j++){
					cin >> meiro[i][j];
				}
			}
			else {
				for(j=0;j<a;j++){
					cin >> meiro[i][j];
				}
			}
		}
		
		map[0][0] = 1;
		que.push(0);
		que.push(0);
		
		while(que.size()>0){
	
			
			x = que.front();
			que.pop();
			y = que.front();
			que.pop();
			
			//右へいけるか
			if(map[x][y+1]==0 && meiro[2*x][y]==0 && y<a-1) {
				map[x][y+1]=map[x][y]+1;
				que.push(x);
				que.push(y+1);
			}
			//下へいけるか
			if(map[x+1][y]==0 && meiro[2*x+1][y]==0 && x<b-1) {
				map[x+1][y]=map[x][y]+1;
				que.push(x+1);
				que.push(y);
			}
			//左へいけるか
			if(map[x][y-1]==0 && meiro[2*x][y-1]==0 && y>0) {
				map[x][y-1]=map[x][y]+1;
				que.push(x);
				que.push(y-1);
			}
			//上へいけるか
			if(map[x-1][y]==0 && meiro[2*x-1][y]==0 && x>0) {
				map[x-1][y]=map[x][y]+1;
				que.push(x-1);
				que.push(y);
			}
			
			
		}
		
		
		cout << map[b-1][a-1]<< endl;
	
	
	}
	
	
	
	for(i=0;i<b;i++){
		for(j=0;j<a;j++){
			printf("map[%d][%d]=%d\n",i,j,map[i][j]);
		}
	}
	
	
	
	for(i=0;i<2*b-1;i++){
		for(j=0;j<a;j++){
			printf("meiro[%d][%d]=%d\n",i,j,meiro[i][j]);
		}
	}
	
	
	
	return 0;
}