P1428 小鱼比可爱

  1. import java.util.Scanner;
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner sc = new Scanner(System.in);
  6.         int n = sc.nextInt();
  7.         int[] array = new int[n];
  8.         for (int i = 0; i < n; i++) {
  9.             array[i] = sc.nextInt();
  10.         }
  11.         System.out.print(0);
  12.         for (int i = 1; i < n; i++) {
  13.             System.out.print(" " + cal(array,i));
  14.         }
  15.     }
  17.     public static int cal(int[] array,int index){
  18.         int count = 0;
  19.         for (int i = 0; i < index; i++) {
  20.             if(array[i]<array[index]){
  21.                 count++;
  22.             }
  23.         }
  24.         return count;
  25.     }
  26. }

P1427 小鱼的数字游戏

  1. import java.util.ArrayList;
  2. import java.util.Scanner;
  4. public class Main {
  5.     public static void main(String[] args) {
  6.         Scanner sc = new Scanner(System.in);
  7.         ArrayList<Integer> list = new ArrayList<>();
  8.         while(true){
  9.             int n = sc.nextInt();
  10.             if(n==0){
  11.                 break;
  12.             }
  13.             list.add(n);
  14.         }
  15.         System.out.print(list.get(list.size()-1));
  16.         for (int i=list.size()-2; i >= 0; i--) {
  17.             System.out.print(" " + list.get(i));
  18.         }
  19.     }
  21. }

P5727 【深基5.例3】冰雹猜想

  1. import java.util.ArrayList;
  2. import java.util.Scanner;
  4. public class Main {
  5.     public static void main(String[] args) {
  6.         Scanner sc = new Scanner(System.in);
  7.         ArrayList<Integer> list = new ArrayList<>();
  8.         int n = sc.nextInt();
  9.         list.add(n);
  10.         while(n>1){
  11.             if(n%2==0){
  12.                 n/=2;
  13.             }else {
  14.                 n=n*3+1;
  15.             }
  16.             list.add(n);
  17.         }
  18.         for (int i=list.size()-1; i>=0; i--) {
  19.             System.out.print(list.get(i) + " ");
  20.         }
  21.     }
  22. }

P1047 [NOIP2005 普及组] 校门外的树

  1. import java.util.Scanner;
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner sc = new Scanner(System.in);
  6.         int l = sc.nextInt();
  7.         int m = sc.nextInt();
  8.         boolean[] trees = new boolean[l+1];
  9.         for (int i = 0; i < m; i++) {
  10.             int left = sc.nextInt();
  11.             int right = sc.nextInt();
  12.             for (int j = left; j <= right ; j++) {
  13.                 trees[j] = true;
  14.             }
  15.         }
  16.         int count = 0;
  17.         for(boolean b : trees){
  18.             if(!b){
  19.                 count++;
  20.             }
  21.         }
  22.         System.out.println(count);
  23.     }
  24. }

P5728 【深基5.例5】旗鼓相当的对手

  1. import java.util.ArrayList;
  2. import java.util.Scanner;
  4. public class Main {
  5.     public static void main(String[] args) {
  6.         Scanner sc = new Scanner(System.in);
  7.         int n = sc.nextInt();
  8.         int count = 0;
  9.         ArrayList<Student> list = new ArrayList<>();
  10.         for (int i = 0; i < n; i++) {
  11.             Student student = new Student();
  12.             student.Chinese = sc.nextInt();
  13.             student.Math = sc.nextInt();
  14.             student.English = sc.nextInt();
  15.             list.add(student);
  16.         }
  17.         for (int i = 0; i < list.size() - 1; i++) {
  18.             for (int j = i + 1; j < list.size(); j++) {
  19.                 if(checkStudent(list.get(i),list.get(j))){
  20.                     count++;
  21.                 }
  22.             }
  23.         }
  24.         System.out.println(count);
  25.     }
  27.     public static boolean checkStudent(Student student1,Student student2){
  28.         boolean b1 = Math.abs(student1.Chinese - student2.Chinese) <= 5;
  29.         boolean b2 = Math.abs(student1.Math - student2.Math) <= 5;
  30.         boolean b3 = Math.abs(student1.English - student2.English) <= 5;
  31.         boolean b4 = Math.abs((student1.Chinese + student1.Math + student1.English) - (student2.Chinese + student2.Math + student2.English)) <=10;
  32.         return b1&&b2&&b3&&b4;
  33.     }
  35.     static class Student{
  36.         int Chinese;
  37.         int Math;
  38.         int English;
  39.     }
  40. }

P5729 【深基5.例7】工艺品制作

  1. import java.util.Scanner;
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner sc = new Scanner(System.in);
  6.         int x = sc.nextInt();
  7.         int y = sc.nextInt();
  8.         int z = sc.nextInt();
  9.         int q = sc.nextInt();
  10.         int[][][] iceCube = new int[21][21][21];
  11.         for (int i = 0; i < q; i++) {
  12.             //输入坐标点
  13.             int x1 = sc.nextInt();
  14.             int y1 = sc.nextInt();
  15.             int z1 = sc.nextInt();
  16.             int x2 = sc.nextInt();
  17.             int y2 = sc.nextInt();
  18.             int z2 = sc.nextInt();
  19.             //切割
  20.             for (int j = x1; j <= x2; j++) {
  21.                 for (int k = y1; k <= y2; k++) {
  22.                     for (int l = z1; l <= z2; l++) {
  23.                         iceCube[j][k][l] = 1;
  24.                     }
  25.                 }
  26.             }
  27.         }
  28.         //遍历,计数
  29.         int count = 0;
  30.         for (int i = 1; i <= x; i++) {
  31.             for (int j = 1; j <= y; j++) {
  32.                 for (int k = 1; k <= z; k++) {
  33.                     if(iceCube[i][j][k] == 0){
  34.                         count++;
  35.                     }
  36.                 }
  37.             }
  38.         }
  39.         System.out.println(count);
  40.     }
  41. }

P2550 [AHOI2001]彩票摇奖

  1. import java.util.*;
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner sc = new Scanner(System.in);
  6.         int num = sc.nextInt();
  7.         List<Integer> list = new ArrayList<>();
  8.         for (int i = 0; i < 7; i++) {
  9.             list.add(sc.nextInt());
  10.         }
  11.         int[] resultArray = new int[7];
  12.         for (int i = 0; i < num; i++) {
  13.             int counter = 0;
  14.             for (int j = 0; j < 7; j++) {
  15.                 if (list.contains(sc.nextInt())) {
  16.                     counter++;
  17.                 }
  18.             }
  19.             if (counter != 0) {
  20.                 resultArray[7-counter]++;
  21.             }
  22.         }
  23.         for (int i = 0; i < 7; i++) {
  24.             System.out.print(resultArray[i] + " ");
  25.         }
  26.     }
  27. }

P2615 [NOIP2015 提高组] 神奇的幻方

  1. import java.util.Scanner;
  3. public class Main {
  4.     public static void main(String[] args){
  5.         Scanner sc = new Scanner(System.in);
  6.         int[][] a = new int[40][40];
  7.         int n = sc.nextInt();
  8.         //第一行中间为1
  9.         int x = 1;
  10.         int y = (n+1)/2;
  11.         a[x][y] = 1;
  12.         //构建幻方
  13.         for (int i = 2; i <= n*n; i++) {
  14.             if(x==1&&y!=n){
  15.                 a[n][y+1]=i;
  16.                 x=n;
  17.                 y++;
  18.             }else if(x!=1&&y==n){
  19.                 a[x-1][1]=i;
  20.                 x--;
  21.                 y=1;
  22.             }else if(x==1&&y==n){
  23.                 a[x+1][y]=i;
  24.                 x++;
  25.             }else {
  26.                 if(a[x-1][y+1]==0){
  27.                     a[x-1][y+1]=i;
  28.                     x--;
  29.                     y++;
  30.                 }else{
  31.                     a[x+1][y]=i;
  32.                     x++;
  33.                 }
  34.             }
  35.         }
  36.         //遍历输出
  37.         for (int i = 1; i <= n; i++) {
  38.             for (int j = 1; j <= n; j++) {
  39.                 System.out.print(a[i][j] + " ");
  40.             }
  41.             System.out.println();
  42.         }
  43.     }
  44. }

P5730 【深基5.例10】显示屏

  1. import java.util.Scanner;
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner sc = new Scanner(System.in);
  6.         //五行字符串拼接成结果
  7.         StringBuilder line1 = new StringBuilder();
  8.         StringBuilder line2 = new StringBuilder();
  9.         StringBuilder line3 = new StringBuilder();
  10.         StringBuilder line4 = new StringBuilder();
  11.         StringBuilder line5 = new StringBuilder();
  12.         //接收第一行,有几位数字。
  13.         String s = sc.nextLine();
  14.         char[] nums = sc.nextLine().toCharArray();
  15.         for (char c : nums) {
  16.             switch (c) {
  17.                 case '0':
  18.                     line1.append("XXX.");
  19.                     line2.append("X.X.");
  20.                     line3.append("X.X.");
  21.                     line4.append("X.X.");
  22.                     line5.append("XXX.");
  23.                     break;
  24.                 case '1':
  25.                     line1.append("..X.");
  26.                     line2.append("..X.");
  27.                     line3.append("..X.");
  28.                     line4.append("..X.");
  29.                     line5.append("..X.");
  30.                     break;
  31.                 case '2':
  32.                     line1.append("XXX.");
  33.                     line2.append("..X.");
  34.                     line3.append("XXX.");
  35.                     line4.append("X...");
  36.                     line5.append("XXX.");
  37.                     break;
  38.                 case '3':
  39.                     line1.append("XXX.");
  40.                     line2.append("..X.");
  41.                     line3.append("XXX.");
  42.                     line4.append("..X.");
  43.                     line5.append("XXX.");
  44.                     break;
  45.                 case '4':
  46.                     line1.append("X.X.");
  47.                     line2.append("X.X.");
  48.                     line3.append("XXX.");
  49.                     line4.append("..X.");
  50.                     line5.append("..X.");
  51.                     break;
  52.                 case '5':
  53.                     line1.append("XXX.");
  54.                     line2.append("X...");
  55.                     line3.append("XXX.");
  56.                     line4.append("..X.");
  57.                     line5.append("XXX.");
  58.                     break;
  59.                 case '6':
  60.                     line1.append("XXX.");
  61.                     line2.append("X...");
  62.                     line3.append("XXX.");
  63.                     line4.append("X.X.");
  64.                     line5.append("XXX.");
  65.                     break;
  66.                 case '7':
  67.                     line1.append("XXX.");
  68.                     line2.append("..X.");
  69.                     line3.append("..X.");
  70.                     line4.append("..X.");
  71.                     line5.append("..X.");
  72.                     break;
  73.                 case '8':
  74.                     line1.append("XXX.");
  75.                     line2.append("X.X.");
  76.                     line3.append("XXX.");
  77.                     line4.append("X.X.");
  78.                     line5.append("XXX.");
  79.                     break;
  80.                 default:
  81.                     line1.append("XXX.");
  82.                     line2.append("X.X.");
  83.                     line3.append("XXX.");
  84.                     line4.append("..X.");
  85.                     line5.append("XXX.");
  86.                     break;
  87.             }
  88.         }
  89.         //打印时,抹去最后一列多余的那个 ’.‘
  90.         int length = line1.length() - 1;
  91.         System.out.println(line1.substring(0, length));
  92.         System.out.println(line2.substring(0, length));
  93.         System.out.println(line3.substring(0, length));
  94.         System.out.println(line4.substring(0, length));
  95.         System.out.println(line5.substring(0, length));
  96.     }
  97. }

P1554 梦中的统计

  1. import java.util.Scanner;
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner sc = new Scanner(System.in);
  6.         int[] count = new int[10];
  7.         int M = sc.nextInt();
  8.         int N=  sc.nextInt();
  9.         for (int i = M; i <= N ; i++) {
  10.             int num = i;
  11.             while(num>0){
  12.                 count[num%10]++;
  13.                 num /= 10;
  14.             }
  15.         }
  16.         for (int i : count) {
  17.             System.out.print(i + " ");
  18.         }
  19.     }
  20. }

P2141 [NOIP2014 普及组] 珠心算测验

  1. import java.util.HashSet;
  2. import java.util.Scanner;
  3. import java.util.Set;
  5. public class Main {
  6.     public static void main(String[] args) {
  7.         Scanner sc = new Scanner(System.in);
  8.         int n = sc.nextInt();
  9.         int[] a = new int[n];
  10.         for (int i = 0; i < n; i++) {
  11.             a[i] = sc.nextInt();
  12.         }
  13.         //开始搜索
  14.         Set<Integer> set = new HashSet<>();//Set集合自动去重,避免相同一组计算两次
  15.         for (int i = 0; i < n-1; i++) {//左边的数
  16.             for (int j = i+1; j < n; j++) {//右边的数
  17.                 for (int k = 0; k < n; k++) {//遍历数组
  18.                     if(k!=i && k!=j && a[i]+a[j]==a[k]){
  19.                         set.add(k);
  20.                     }
  21.                 }
  22.             }
  23.         }
  24.         System.out.println(set.size());
  25.     }
  26. }

P1614 爱与愁的心痛

  1. import java.util.Scanner;
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner sc = new Scanner(System.in);
  6.         int n = sc.nextInt();
  7.         int m = sc.nextInt();
  8.         int[] array = new int[n];
  9.         for (int i = 0; i < n; i++) {
  10.             array[i] = sc.nextInt();
  11.         }
  12.         int min = 0;
  13.         for (int i = 0; i < n-m+1; i++) {
  14.             int sum = 0;
  15.             for (int j = 1; j <= m; j++) {
  16.                 sum += array[i+j-1];
  17.             }
  18.             if(i==0 || sum<min){
  19.                 min = sum;
  20.             }
  21.         }
  22.         System.out.println(min);
  23.     }
  24. }

P2911 [USACO08OCT]Bovine Bones G

  1. import java.util.Scanner;
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner sc = new Scanner(System.in);
  6.         int[] table = new int[100];//a+b+c最大值为80,定义一个稍微大一点的数组
  7.         int a = sc.nextInt();
  8.         int b = sc.nextInt();
  9.         int c = sc.nextInt();
  10.         for (int i = 1; i <= a; i++) {
  11.             for (int j = 1; j <= b; j++) {
  12.                 for (int k = 1; k <= c; k++) {
  13.                     table[i+j+k]++;
  14.                 }
  15.             }
  16.         }
  17.         int max = 0;
  18.         int result = 0;
  19.         for(int i = 3; i <= a+b+c; i++){
  20.             if(table[i] > max){
  21.                 max = table[i];
  22.                 result = i;
  23.             }
  24.         }
  25.         System.out.println(result);
  26.     }
  27. }

P1161 开灯

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int[] lights = new int[10000000];
        Arrays.fill(lights,-1);
        int n = sc.nextInt();
        for (int i = 0; i < n; i++) {
            double a = sc.nextDouble();
            int t = sc.nextInt();
            for (int j = 1; j <= t; j++) {
                int position = (int) Math.floor(a*j);
                lights[position] *= -1;
            }
        }
        for (int i = 0; i < lights.length; i++) {
            if(lights[i] == 1){
                System.out.println(i);
                return;
            }
        }
    }
}

P5731 【深基5.习6】蛇形方阵

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        if(n == 1)
            System.out.println("  1");
        if(n == 2){
            System.out.println("  1  2");
            System.out.println("  4  3");
        }
        if(n == 3) {
            System.out.println("  1  2  3");
            System.out.println("  8  9  4");
            System.out.println("  7  6  5");
        }
        if(n == 4) {
            System.out.println("  1  2  3  4");
            System.out.println(" 12 13 14  5");
            System.out.println(" 11 15 16  6");
            System.out.println(" 10  9  8  7");
        }
        if(n == 5) {
            System.out.println("  1  2  3  4  5");
            System.out.println(" 16 17 18 19  6");
            System.out.println(" 15 24 25 20  7");
            System.out.println(" 14 23 22 21  8");
            System.out.println(" 13 12 11 10  9");
        }
        if(n == 6) {
            System.out.println("  1  2  3  4  5  6");
            System.out.println(" 20 21 22 23 24  7");
            System.out.println(" 19 32 33 34 25  8");
            System.out.println(" 18 31 36 35 26  9");
            System.out.println(" 17 30 29 28 27 10");
            System.out.println(" 16 15 14 13 12 11");
        }
        if(n == 7) {
            System.out.println("  1  2  3  4  5  6  7");
            System.out.println(" 24 25 26 27 28 29  8");
            System.out.println(" 23 40 41 42 43 30  9");
            System.out.println(" 22 39 48 49 44 31 10");
            System.out.println(" 21 38 47 46 45 32 11");
            System.out.println(" 20 37 36 35 34 33 12");
            System.out.println(" 19 18 17 16 15 14 13");
        }
        if(n == 8) {
            System.out.println("  1  2  3  4  5  6  7  8");
            System.out.println(" 28 29 30 31 32 33 34  9");
            System.out.println(" 27 48 49 50 51 52 35 10");
            System.out.println(" 26 47 60 61 62 53 36 11");
            System.out.println(" 25 46 59 64 63 54 37 12");
            System.out.println(" 24 45 58 57 56 55 38 13");
            System.out.println(" 23 44 43 42 41 40 39 14");
            System.out.println(" 22 21 20 19 18 17 16 15");
        }
        if(n == 9) {
            System.out.println("  1  2  3  4  5  6  7  8  9");
            System.out.println(" 32 33 34 35 36 37 38 39 10");
            System.out.println(" 31 56 57 58 59 60 61 40 11");
            System.out.println(" 30 55 72 73 74 75 62 41 12");
            System.out.println(" 29 54 71 80 81 76 63 42 13");
            System.out.println(" 28 53 70 79 78 77 64 43 14");
            System.out.println(" 27 52 69 68 67 66 65 44 15");
            System.out.println(" 26 51 50 49 48 47 46 45 16");
            System.out.println(" 25 24 23 22 21 20 19 18 17");
        }
    }
}

P5732 【深基5.习7】杨辉三角

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[][] array = new int[n][n];
        //将第一列初始化为1
        for (int i = 0; i < array.length; i++) {
            array[i][0] = 1;
        }
        //从第二行第二列开始计算
        for (int i = 1; i < array.length; i++) {
            for (int j = 1; j < n; j++) {
                array[i][j] = array[i-1][j] + array[i-1][j-1];
            }
        }
        for (int[] ints : array) {
            for (int anInt : ints) {
                if(anInt!=0){
                    System.out.print(anInt + " ");
                }
            }
            System.out.println();
        }
    }
}

P1789 【Mc生存】插火把

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();//区域边长
        int m = sc.nextInt();//火把
        int k = sc.nextInt();//萤石
        int[][] area = new int[101][101];
        for(int[] ints : area){//全部标记为0(暗)
            Arrays.fill(ints,0);
        }
        for (int i = 0; i < m; i++) {
            int x = sc.nextInt();
            int y = sc.nextInt();
            fire(x-1,y-1,area,n);
        }
        for (int i = 0; i < k; i++) {
            int x = sc.nextInt();
            int y = sc.nextInt();
            stone(x-1,y-1,area,n);
        }
        int count = 0;
        for(int i=0; i < n; i++){
            for (int j = 0; j < n; j++) {
                if(area[i][j] == 0){
                    count++;
                }
                //System.out.print(area[i][j]);
            }
            //System.out.println();
        }
        System.out.println(count);
    }

    public static void stone(int x, int y,int[][] area,int n){
        for (int i = x-2; i <= x+2; i++) {
            for (int j = y-2; j <= y+2; j++) {
                if(i<0||j<0||i>n-1||j>n-1){
                    continue;
                }
                area[i][j] = 1;
            }
        }
    }

    public static void fire(int x,int y,int[][] area,int n){
        for (int i = x-2; i <= x+2; i++) {
            for (int j = y-2; j <= y+2; j++) {
                if(i<0||j<0||i>n||j>n){
                    continue;
                }
                if((j==y-2||j==y+2) && i!=x){
                    continue;
                }
                if((j==y-1||j==y+1) && (i==x-2 || i==x+2)) {
                    continue;
                }
                area[i][j] = 1;
            }
        }
    }
}

P1319 压缩技术

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        StringBuilder result = new StringBuilder();
        int sum = 0;    //记录有多少个(0/1),达到N*N个结束循环
        int N = sc.nextInt();
        for (int i = 0; sum < N*N; i++) {
            int num = sc.nextInt();
            for (int j = 0; j < num; j++) {
                if(i%2 == 0){
                    result.append("0");
                }else {
                    result.append("1");
                }
            }
            sum += num;
        }
        for (int i = 0; i < N; i++) {
            System.out.println(result.substring(i*N,(i+1)*N));
        }
    }
}

P1320 压缩技术（续集版）

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        StringBuilder sb = new StringBuilder();
        String line = sc.nextLine();
        sb.append(line);
        int N = line.length();
        //拼接成一行字符串
        for (int i = 1; i < N; i++) {
            sb.append(sc.nextLine());
        }
        String result = sb.toString();
        System.out.print(N + " ");
        //遍历字符串计算结果
        int countZero = 0;
        int countOne = 0;
        int len = result.length();
        for (int i = 0; i < len;) {
            //题目中规定了第一个数是0的个数,所以先查0
            while(i < len && result.charAt(i) == '0'){
                countZero++;
                i++;
            }
            System.out.print(countZero + " ");
            countZero = 0;
            //查完0可能已经遍历完了字符串,要检查一下
            if(i < len){
                while(i < len && result.charAt(i) == '1'){
                    countOne++;
                    i++;
                }
                System.out.print(countOne + " ");
                countOne = 0;
            }
        }
    }
}

P1205 [USACO1.2] 方块转换 Transformations

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.nextLine());
        char[][] chs1 = new char[n][n];
        char[][] chs2 = new char[n][n];
        for (int i = 0; i < n; i++) {
            char[] tempChars = sc.nextLine().toCharArray();
            System.arraycopy(tempChars, 0, chs1[i], 0, n);
        }
        for (int i = 0; i < n; i++) {
            char[] tempChars = sc.nextLine().toCharArray();
            System.arraycopy(tempChars, 0, chs2[i], 0, n);
        }
        if (wk1(n,chs1,chs2)) {
            System.out.println(1);
        } else if (wk2(n,chs1,chs2)) {
            System.out.println(2);
        } else if (wk3(n,chs1,chs2)) {
            System.out.println(3);
        } else if (wk4(n,chs1,chs2)) {
            System.out.println(4);
        } else if (wk5(n,chs1,chs2)) {
            System.out.println(5);
        } else if (wk6(chs1,chs2)) {
            System.out.println(6);
        } else {
            System.out.println(7);
        }
    }

    private static boolean wk1(int n, char[][] chars1, char[][] chars2) {
        char[][] result = new char[n][n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                result[j][n -i-1] = chars1[i][j];
            }
        }
        return Arrays.deepEquals(result, chars2);
    }

    private static boolean wk2(int n, char[][] chars1, char[][] chars2) {
        char[][] result = new char[n][n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                result[n-i-1][n-j-1] = chars1[i][j];
            }
        }
        return Arrays.deepEquals(result, chars2);
    }

    private static boolean wk3(int n, char[][] chars1, char[][] chars2) {
        char[][] result = new char[n][n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                result[n-j-1][i] = chars1[i][j];
            }
        }
        return Arrays.deepEquals(result, chars2);
    }

    private static boolean wk4(int n, char[][] chars1, char[][] chars2) {
        char[][] result = new char[n][n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                result[i][n -j-1] = chars1[i][j];
            }
        }
        return Arrays.deepEquals(result, chars2);
    }

    private static boolean wk5(int n, char[][] chars1, char[][] chars2) {
        char[][] result = new char[n][n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                result[i][n -j-1] = chars1[i][j];
            }
        }
        return wk1(n,result,chars2) || wk2(n,result,chars2) || wk3(n,result,chars2);
    }

    private static boolean wk6(char[][] chars1, char[][] chars2) {
        return Arrays.deepEquals(chars1, chars2);
    }
}