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 <stdio.h>
#include<math.h>
#include <algorithm>
#include <stack>
using namespace std;
 
bool rangeCheck(int row, int col){
    if(row % 2 == 0){
        if(row >= 0 && row <= 8 && col >= 0 && col <= 3)return true;
        else{
            return false;
        }
    }else{
        if(row >= 0 && row <= 8 && col >= 0 && col <= 4)return true;
        else{
            return false;
        }
    }
}
 
int main(){
    int checkTable[9][5][4],row,col;
    char array[9][6];
 
    for(int i = 0; i < 9; i++){
        for(int k=0; k < 5; k++){
            for(int p=0;p<4;p++){
                checkTable[i][k][p] = 0;
            }
        }
    }
 
    for(int i=0;i < 9; i++){
        scanf("%s",array[i]);
    }
 
    printf("R");
    char current = 'R';
 
    checkTable[0][0][1] = 1;
 
    row = 0,col = 0;
 
    while(true){
        switch(current){
        case 'L':
            if(rangeCheck(row+1,col) == true &&checkTable[row+1][col][3] == 0 && array[row+1][col] == '1'){
                printf("D");
                checkTable[row+1][col][3] = 1;
                current = 'D';
                row = row+1;
            }else if(rangeCheck(row,col-1) == true &&checkTable[row][col-1][0] == 0 && array[row][col-1] == '1'){
                printf("L");
                checkTable[row][col-1][0] = 1;
                col = col-1;
            }else if(rangeCheck(row-1,col) == true &&checkTable[row-1][col][2] == 0 && array[row-1][col] == '1'){
                printf("U");
                checkTable[row-1][col][2] = 1;
                current = 'U';
                row = row-1;
            }else{
                printf("R");
                checkTable[row][col][1] = 1;
                current = 'R';
            }
            break;
        case 'R':
            if(rangeCheck(row-1,col+1) == true &&checkTable[row-1][col+1][2] == 0 && array[row-1][col+1] == '1'){
                printf("U");
                checkTable[row-1][col+1][2] = 1;
                current = 'U';
                row = row-1;
                col = col+1;
            }else if(rangeCheck(row,col+1) == true &&checkTable[row][col+1][1] == 0 && array[row][col+1] == '1'){
                printf("R");
                checkTable[row][col+1][1] = 1;
                col = col+1;
            }else if(rangeCheck(row+1,col+1) == true&&checkTable[row+1][col+1][3] == 0 && array[row+1][col+1] == '1'){
                printf("D");
                checkTable[row+1][col+1][3] = 1;
                current = 'D';
                row = row+1;
                col = col+1;
            }else{
                printf("L");
                checkTable[row][col][0] = 1;
                current = 'L';
            }
            break;
        case 'U':
            if(rangeCheck(row-1,col-1) == true &&checkTable[row-1][col-1][0] == 0 && array[row-1][col-1] == '1'){
                printf("L");
                checkTable[row-1][col-1][0] = 1;
                current = 'L';
                row = row-1;
                col = col-1;
            }else if(rangeCheck(row-2,col) == true&&checkTable[row-2][col][2] == 0 && array[row-2][col] == '1'){
                printf("U");
                checkTable[row-2][col][2] = 1;
                row = row - 2;
            }else if(rangeCheck(row-1,col)== true &&checkTable[row-1][col][1] == 0 && array[row-1][col] == '1'){
                printf("R");
                checkTable[row-1][col][1] = 1;
                current = 'R';
                row = row-1;
            }else{
               printf("D");
               checkTable[row][col][3] = 1;
               current = 'D';
            }
            break;
        case 'D':
            if(rangeCheck(row+1,col) == true&&checkTable[row+1][col][1] == 0 && array[row+1][col] == '1'){
                printf("R");
                checkTable[row+1][col][1] = 1;
                current = 'R';
                row = row+1;
            }else if(rangeCheck(row+2,col) == true&&checkTable[row+2][col][3] == 0 && array[row+2][col] == '1'){
                printf("D");
                checkTable[row+2][col][3] = 1;
                row = row+2;
            }else if(rangeCheck(row+1,col-1) == true&&checkTable[row+1][col-1][0] == 0 && array[row+1][col-1] == '1'){
                printf("L");
                checkTable[row+1][col-1][0] = 1;
                current = 'L';
                row = row +1;
                col = col -1;
            }else{
                printf("U");
                checkTable[row][col][2] = 1;
                current = 'U';
            }
            break;
        }
        if(row == 0 && col == 0)break;
    }
 
   printf("\n");
 
    return 0;
}

C++: // 今向いている方向にとっての左から始めて、時計回りに壁を探して、最初にみつけた壁の方向に進む
#include <fstream>
#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
using namespace std;
struct Direction {
  bool u, d, r, l;
};

void dump_Direction(Direction di) {
  cout << "[" << di.u << di.r << di.d << di.l << "]";
}



int main() {
  // ifstream cin("../test.txt");
  Direction g[5][5];
  for (int i = 0; i < 5; i++) {
    for (int j = 0; j < 5; j++) {
      g[i][j].u = false;
      g[i][j].d = false;
      g[i][j].r = false;
      g[i][j].l = false;
    }
  }
  for (int i = 0; i < 9; i++) {
    string s;
    cin >> s;
    if (i % 2 == 0) {
      for (int j = 0; j < 4; j++) {
        int k = i / 2;
        g[k][j].r = (s[j] == '1');
        g[k][j+1].l = (s[j] == '1');
      }
    } else {
      for (int j = 0; j < 5; j++) {
        int k = i / 2;
        g[k][j].d = (s[j] == '1');
        g[k+1][j].u = (s[j] == '1');
      }
    }
  }
  // 表示用
  // for (int i = 0; i < 5; i++) {
  //   for (int  j = 0; j < 5; j++) {
  //     dump_Direction(g[i][j]);
  //   }
  //   cout << endl;
  // }

  int x = 0;
  int y = 0;
  int d = 0; // 0: u, 1: r, 2: d, 3: l
  int dx[] = {0,1,0,-1};
  int dy[] = {-1,0,1,0};
  char c[] = {'U','R','D','L'};
  while (true) {
    bool dir[] = {g[y][x].u, g[y][x].r, g[y][x].d, g[y][x].l};
    // dump_Direction(g[y][x]);
    int i = 0;
    for (;i < 4; i++) {
      if (dir[(i+d)%4]) break;
    }
    int j = (i+d)%4;
    // cout << j;
    x += dx[j];
    y += dy[j];
    cout << c[j];
    d = (j + 3) % 4;
    if (!(x|y)) break;
  }
  cout << endl;
}