2022年 蓝桥杯 模拟赛 Java 第八题

import java.util.Scanner;

/**
 * @author songxh
 * @create 2022-03-13-11:37
 */
public class 模拟赛08 {

    static int m,n,r,c;

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        n = scanner.nextInt();
        m = scanner.nextInt();
        scanner.nextLine();
        char[][] arr=new char[n][m];
        for (int i = 0; i < n; i++) {
            String line = scanner.nextLine();
            char[] chars = line.toCharArray();
            for (int j = 0; j < chars.length; j++) {
                arr[i][j]=chars[j];
            }
        }

        r = scanner.nextInt();
        c = scanner.nextInt();
        char[][] ch=new char[r][c];
        scanner.nextLine();
        for (int i = 0; i < r; i++) {
            String line = scanner.nextLine();
            char[] chars = line.toCharArray();
            for (int j = 0; j < chars.length; j++) {
                ch[i][j]=chars[j];
            }
        }

        int temp=0;

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (i+r<=n && j+c<=m){
                    if (ff(ch,arr,i,j)){
                        System.out.println((i+1)+" "+(j+1));
                        return;
                    }
                }
            }
        }
        if (temp==0){
            System.out.println("NO");
        }
    }

    private static boolean ff(char[][] ch,char[][] arr,int i,int j) {
        boolean flag=true;
        for (int k = 0; k < r; k++) {
            for (int l = 0; l < c; l++) {
                if (ch[k][l]=='1' && arr[i+k][j+l]=='0'){
                    flag=false;
                    break;
                }
            }
        }
        return flag;
    }
}