fcbruce

被自己蠢哭了。。。。 250-point problem 国际象棋棋盘上给出两个坐标，问象从一个走到另一个最少要几步。 黑格象只能走黑格，白格象只能走白格，只要判断两个坐标的颜色是否相同就能判断是否可达，观察棋盘可以发现坐标的奇偶性决定了格子的颜色;可达的情况下最多两步就能达到，所以只要判断格子是否在同一条斜线上就行了。 #include #include #include #incl

Problem Statement   Let's say you have a binary string such as the following: 011100011 One way to encrypt this string is to add to each digit the sum of its adjacent digits. For exampl

Problem Statement   We have R red, G green, and B blue balls. We want to divide them into as few packages as possible. Each package must contain 1, 2, or 3 balls. Additionally, each package m

Problem Statement   Consider the 3x3x3 cube shown above. There are nine squares on each of its six faces, and each face is colored using the following pattern: The four corner squares