Specific topics:
The first question: upper left corner of the map come to the bottom right corner, in the middle there is an obstacle, a total of how many moves?
Ideas: dfs + memory of
The second question:
Idea: each number subtracted is the value of x corresponding bit binary 1, and finally make a number of public statistics
Third question:
Ideas:
- DP [i] [j]: indicates the i-th digit before and k-j is the number of a remainder, the operation proceeds: dp [i] [j] = dp [i-1] [t] + sigma (count [ (j-t + k)% k])
- count saved, all the numbers inside the case LR% k is the number of
Fourth Question
Idea:
for each node in the BFS, TLE, but can not think of one.
Ideas: No
The fifth question
Ideas:
No