「もっとプログラム脳を鍛える数学パズル」_Q41 (code:Ruby) -> Rust - Qiita

W, H = 10, 10 @memo = {} def search(tile) return @memo[tile] if @memo[tile] return 1 if tile.min == H pos = tile.index(tile.min) cnt = 0 [[1,1],[2,2],[4,2], [4,4]].each do |px,py| check = true px.times do |x| if (pos + x >= W) || (tile[pos + x] + py > H) check = false elsif tile[pos + x] != tile[pos] check = false end end next if !check px.times do |x| tile[pos + x] += py end cnt += search(tile) p