Pretty easy problem. Kings, Queens and Rooks are easy; with Knights you need to realize that knigns basically attack boxes of the opposite color. Once you figure that out, you are golden.<\/p>\n
\r\nimport java.io.PrintWriter;\r\nimport java.util.Scanner;\r\n\r\n\/**\r\n * \r\n * @author Sanchit M. Bhatnagar\r\n * @see http:\/\/uhunt.felix-halim.net\/id\/74004\r\n * \r\n *\/\r\npublic class P278 {\r\n\r\n public static void main(String[] args) {\r\n Scanner sc = new Scanner(System.in);\r\n PrintWriter out = new PrintWriter(System.out);\r\n\r\n int N = sc.nextInt();\r\n for (int zz = 0; zz < N; zz++) {\r\n String type = sc.next();\r\n int R = sc.nextInt();\r\n int C = sc.nextInt();\r\n int min = Math.min(R, C);\r\n int max = Math.max(R, C);\r\n if (type.equals("r") || type.equals("Q")) {\r\n out.println(min);\r\n } else if (type.equals("k")) {\r\n int a = max \/ 2;\r\n int b = (max - a);\r\n int c = min \/ 2;\r\n int d = (min - c);\r\n out.println(Math.max(a * c + b * d, a * d + b * c));\r\n } else if (type.equals("K")) {\r\n out.println(((max + 1) \/ 2) * ((min + 1) \/ 2));\r\n }\r\n }\r\n\r\n out.close();\r\n sc.close();\r\n }\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"Pretty easy problem. Kings, Queens and Rooks are easy; with Knights you need to realize that knigns basically attack boxes of the opposite color. Once you figure that out, you are golden. import java.io.PrintWriter; import java.util.Scanner; \/** * * @author Sanchit M. Bhatnagar * @see http:\/\/uhunt.felix-halim.net\/id\/74004 * *\/ public class P278 { public static void … Continue reading UVA 278 – Chess<\/span>