ACWing蓝桥杯集训·每日一题2025-6122. 农夫约翰的奶酪块-Java

不吃冰激凌的猫猫

于 2025-02-19 20:35:12 发布

阅读量403

点赞数 1

CC 4.0 BY-SA版权

文章标签：蓝桥杯 java

本文链接：https://blog.youkuaiyun.com/pro_daily/article/details/145738144

题目

代码

import java.util.Scanner;

public class Main {
    static int N=1001;
    
    public static void main(String args[]) {
        Scanner scan = new Scanner(System.in);
        int XY[][] = new int[N][N];
        int XZ[][] = new int[N][N];
        int YZ[][] = new int[N][N];
        int n = scan.nextInt();
        int q = scan.nextInt();
        int res = 0;
        while(q-->0){
            
            int x = scan.nextInt();
            int y = scan.nextInt();
            int z = scan.nextInt();
            XY[x][y]++;
            XZ[x][z]++;
            YZ[y][z]++;
            if(XY[x][y]>=n) res++;
            if(XZ[x][z]>=n) res++;
            if(YZ[y][z]>=n) res++;
            System.out.println(res);
        }
 
    }
}