一个正方形平面被分为N*N个单元格，其周围被墙包围，其中有一个滑块和一个坑，单 元格之间可能存在墙。每次操作可以将滑块往上下左右中的某一个方向滑动，滑块被滑动后会朝滑动方向不断移动直到遇到墙或者掉入坑中为止。问最少滑动多少次能将滑块滑到坑中-Plane is divided into a square cell of N* N, which is surrounded by the surrounding wall, which has a slider and a pit, a singl

这款程序能坑人，而且死坑，并且坑死人不偿命，保证坑死一群人-Pit traps, the app can and death, and don t want to pit the dead, ensure the pit a group of people to death