Go: package main

import (
	"bufio"
	"os"
	"strings"
	"strconv"
	"fmt"
)

var points [5][5][4]bool

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	for i := 0; i < 9; i++ {
		y := i/2
		if i%2 == 0 {
			scanner.Scan()
			info := strings.Split(scanner.Text(), "")
			for k := range info {
				e, _ := strconv.Atoi(info[k])
				if e != 0 {
					points[y][k][1], points[y][k+1][3] = true, true
				}
			}
		} else {
			scanner.Scan()
			info := strings.Split(scanner.Text(), "")
			for k := range info {
				e, _ := strconv.Atoi(info[k])
				if e != 0 {
					points[y][k][2], points[y+1][k][0] = true, true
				}
			}
		}
	}
	x := 1
	y := 0
	dir := 1
	dx := []int{0, 1, 0, -1}
	dy := []int{-1, 0, 1, 0}
	ds := "URDL"
	fmt.Printf("%s", string(ds[dir]))
	for !(x == 0 && y == 0) {
		if points[y][x][(dir+3)%4] {
			dir = (dir+3)%4
		} else if points[y][x][dir] {

		} else if points[y][x][(dir+1)%4] {
			dir = (dir+1)%4
		} else {
			dir = (dir+2)%4
		}
		x += dx[dir]
		y += dy[dir]
		fmt.Printf("%s", string(ds[dir]))
	}
	fmt.Println()
}

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

typedef vector <string> VS;

VS R;
string D = "RDLU";
const int RIGHT = 0;
const int DOWN = 1;
const int LEFT = 2;
const int UP = 3;

void dfs( int dir, int x, int y, int a ) {
    cout << D[dir];
    if ( dir != RIGHT && x == 0 && y == 0 ) return;

    if ( dir == RIGHT ) {
        // 0:ue, 1:sita
        if ( a == 0 ) {
            if ( y-1 >= 0 && x+1 < R[y-1].size() && R[y-1][x+1] == '1' ) {
                return dfs( UP, x+1, y-1, 0 );
            }
            if ( x+1 < R[y].size() && R[y][x+1] == '1' ) {
                return dfs( RIGHT, x+1, y, 0 );
            }
            if ( y+1 < R.size() && x+1 < R[y+1].size() && R[y+1][x+1] == '1' ) {
                return dfs( DOWN, x+1, y+1, 1 );
            }
        } else {
            if ( y+1 < R.size() && x+1 < R[y+1].size() && R[y+1][x+1] == '1' ) {
                return dfs( DOWN, x+1, y+1, 0 );
            }
            if ( x+1 < R[y].size() && R[y][x+1] == '1' ) {
                return dfs( RIGHT, x+1, y, 1 );
            }
            if ( y-1 >= 0 && x+1 < R[y-1].size() && R[y-1][x+1] == '1' ) {
                return dfs( UP, x+1, y-1, 1 );
            }
        }
    } else if ( dir == DOWN ) {
        // 0:hidari, 1:migi
        if ( a == 0 ) {
            if ( y+1 < R.size() && x-1 >= 0 && R[y+1][x-1] == '1' ) {
                return dfs( LEFT, x-1, y+1, 0 );
            }
            if ( y+2 < R.size() && R[y+2][x] == '1' ) {
                return dfs( DOWN, x, y+2, 0 );
            }
            if ( y+1 < R.size() && x < R[y+1].size() && R[y+1][x] == '1' ) {
                return dfs( RIGHT, x, y+1, 1 );
            }
        } else {
            if ( y+1 < R.size() && x < R[y+1].size() && R[y+1][x] == '1' ) {
                return dfs( RIGHT, x, y+1, 0 );
            }
            if ( y+2 < R.size() && R[y+2][x] == '1' ) {
                return dfs( DOWN, x, y+2, 1 );
            }
            if ( y+1 < R.size() && x-1 >= 0 && R[y+1][x-1] == '1' ) {
                return dfs( LEFT, x-1, y+1, 1 );
            }
        }
    } else if ( dir == LEFT ) {
        // 0:ue, 1:sita
        if ( a == 0 ) {
            if ( y-1 >= 0 && x < R[y-1].size() && R[y-1][x] == '1' ) {
                return dfs( UP, x, y-1, 1 );
            }
            if ( x-1 >= 0 && R[y][x-1] == '1' ) {
                return dfs( LEFT, x-1, y, 0 );
            }
            if ( y+1 < R.size()&& x < R[y+1].size() && R[y+1][x] == '1' ) {
                return dfs( DOWN, x, y+1, 0 );
            }
        } else {
            if ( y+1 < R.size()&& x < R[y+1].size() && R[y+1][x] == '1' ) {
                return dfs( DOWN, x, y+1, 1 );
            }
            if ( x-1 >= 0 && R[y][x-1] == '1' ) {
                return dfs( LEFT, x-1, y, 1 );
            }
            if ( y-1 >= 0 && x < R[y-1].size() && R[y-1][x] == '1' ) {
                return dfs( UP, x, y-1, 0 );
            }
        }
    } else if ( dir == UP ) {
        // 0:hidari, 1:migi
        if ( a == 0 ) {
            if ( y-1 >= 0 && x-1 >= 0 && R[y-1][x-1] == '1' ) {
                return dfs( LEFT, x-1, y-1, 1 );
            }
            if ( y-2 >= 0 && R[y-2][x] == '1' ) {
                return dfs( UP, x, y-2, 0 );
            }
            if ( y-1 >= 0 && x < R[y-1].size() && R[y-1][x] == '1' ) {
                return dfs( RIGHT, x, y-1, 0 );
            }
        } else {
            if ( y-1 >= 0 && x < R[y-1].size() && R[y-1][x] == '1' ) {
                return dfs( RIGHT, x, y-1, 1 );
            }
            if ( y-2 >= 0 && R[y-2][x] == '1' ) {
                return dfs( UP, x, y-2, 1 );
            }
            if ( y-1 >= 0 && x-1 >= 0 && R[y-1][x-1] == '1' ) {
                return dfs( LEFT, x-1, y-1, 0 );
            }
        }
    }
}

int main() {
    R = VS( 9 );
    for ( int i = 0; i < 9; i++ ) {
        cin >> R[i];
    }
    dfs( 0, 0, 0, 0 );
    cout << endl;
    return 0;
}