A Knights Journey(dfs)

The input begins with a positive integer n in the first line. The following lines contain n test cases. Each test case consists of a single line with two positive integers p and q, such that 1 <= p * q <= 26. This represents a p * q chessboard, where p describes how many different square numbers 1, . . . , p exist, q describes how many different square letters exist. These are the first q letters of the Latin alphabet: A, . . .

,风景如何,其实并不重要。重要的是,你在我的身边。

A Knights Journey(dfs)

相关文章:

你感兴趣的文章:

标签云: