import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int goodness[][] = new int[50][50];
int coordinate[][][][] = new int[11][11][11][11];// x1 y1 x2 y2
int m = sc.nextInt();
while (true) {
int n = sc.nextInt();
int q = sc.nextInt();
int num = sc.nextInt();
if (n == 0 && q == 0 && num == 0)
break;
goodness[n][q] = num;
}
for (int x1 = 1; x1 <= m; x1++) {
for (int y1 = 1; y1 <= m; y1++) {
for (int x2 = 1; x2 <= m; x2++) {
for (int y2 = 1; y2 <= m; y2++) {
洛谷 P1004 方格取数 Java解法
最新推荐文章于 2022-07-15 22:36:14 发布