grid paths

use std::collections::HashMap;

fn main() {
    let _grid: [[bool; 9]; 9] = [
        [true, true, true, true, true, true, true, true, true],
        [true, false, false, false, false, false, false, false, true],
        [true, false, false, false, false, false, false, false, true],
        [true, false, false, false, false, false, false, false, true],
        [true, false, false, false, false, false, false, false, true],
        [true, false, false, false, false, false, false, false, true],
        [true, false, false, false, false, false, false, false, true],
        [true, false, false, false, false, false, false, false, true],
        [true, true, true, true, true, true, true, true, true],
    ];

    let paths: i32 = 0;
    let mut qc: i32 = 0;
    let mut p: [i32; 48] = [0; 48];
    let umap = HashMap::from([('?', 0), ('U', 1), ('D', 2), ('L', 3), ('R', 4)]);
    let mut input = String::new();
    let _ = std::io::stdin().read_line(&mut input);
    let c = 'U';
    for i in 0..48 {
        p[i] = *umap.get(&c).unwrap();
        if p[i] == '?' as i32 {
            qc += 1
        }
    }
    println!("{}", "output");
}