Description: Now, give a square of side length n, as well as the quantity required feudal fief of the k, find all ask you to program the number of possible resettlement. (n ≤ l00, k ≤ 2n2-2n+1). Probably a lot of programs because of the number, you only need to program the number of output divided by the remainder of 504 can. 【Input】 only his party, the two integers n and k, with a space between separated. 【Output】 an integer, said the program divided by the remainder of 504. Sample input 2】 【2】 【sample output 4
To Search:
- [short_path] - Four shortest path algorithm for example
- [tanxin] - Greedy Algorithm Solution classic proble
File list (Check if you may need any files):
empire.docx