public class Exercisel {
    public static void main(String[] args) {
        int x = 5;
        int i = 1, j = 20;
        int max = 0;
        if (x >= 0 && x <= 10)
            i = x * x;
//        max = (x > j) ? i : j;
        if (x > j) {
            max = i;
        }
        else {
            max = j;
        }
        System.out.print("max=" + max);
    }
}

public class HalfMatrix {
    public static void main(String[] args) {
        int n = 3;
        int i, j;
        for (i = 0; i < n; i++) {
            for (j = 0; j < n; j++) {
                if (j < i) {
                    System.out.print("+");
                } else {
                    System.out.print("*");
                }
            }
            System.out.println();
        }
    }
}


//i = 0   j = 1 2 3    ***
//i = 1   j = 1 2 3    +**
//i = 2   j = 1 2 3    ++*

public class PrimeNumber {
    public static void main(String[] args) {
        int limit = 100;
        for (int i = 2; i <= limit; i++) {
            if (isPrime(i)) {
                System.out.print(i+ " ");
//                System.out.println();
            }
        }
    }

    public static boolean isPrime(int number) {
        if (number <= 1) {
            return false;
        }
        for (int i = 2; i <= Math.sqrt(number); i++) {
            if (number % i == 0) {
                return false;
            }
        }
        return true;
    }
}

public class GOOD {
    public static void main(String[] args) {
        int n = 100;
        int total = 0;
        int[] arr = new int[n % 2 == 0 ? n / 2 : (int) (n / 2 + 1)];
        // 找奇数
        for (int i = 0, j = 1; j < n; j += 2) {
            arr[i++] = j;
        }
        // 素数长度
        for (int i = 0; i < arr.length; i++) {
            total += isPrime(arr[i]) ? 1 : 0;
        }

        System.out.println("奇数素数长度：" + total);
        // 将即使奇数又是素数的数放入数组
        int[] b = new int[total];
        // 将即使奇数又是素数的数放入数组
        for (int i = 0, j = 0; i < arr.length; i++) {
            if (isPrime(arr[i])) {
//                System.out.println(arr[i]);
                b[j++] = arr[i];
            }
        }
        // 打印数组中的内容
        for (int i = 0; i < b.length; i++) {
            System.out.print(b[i] + " ");
        }
    }
    public static boolean isPrime(int number) {
        if (number <= 1) {
            return false;
        }
        for (int i = 2; i <= Math.sqrt(number); i++) {
            if (number % i == 0) {
                return false;
            }
        }
        return true;
    }
}