2010年ACM亚洲赛福州赛区现场赛题目.pdfVIP

Problem A. Knights Problem Description You must have heard of the Knights Tour problem. In that problem, a knight is placed on an empty chess board and you are to determine whether it can visit each square on the board exactly once. Lets consider a variation of the knights tour problem. In this problem, a knight is place on an infinite plane and its restricted to make certain moves. For example, it may be placed at (0, 0) and can make two kinds of moves: Denote its current place as (x,y), it can only move to (x+1,y+2) or (x+2,y+1). Th