코드업(Codeup) 2628 : 케익 자르기

import java.util.List;
import java.util.Scanner;
import java.util.Vector;
import java.util.Arrays;

public class Main {	
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] point = new int[4];

        for(int i = 0; i < 4; i++) {
            point[i] = sc.nextInt();
        }

        int smallPnt_1 = point[0] < point[1] ? point[0] : point[1];
        int largePnt_1 = point[0] > point[1] ? point[0] : point[1];

        int reverse_distance_1 = 100 - (largePnt_1 - smallPnt_1);

        Boolean isIn = false;
        Boolean isOut = false;

        for(int i = 2; i <= 3; i++) {
            if(point[i] > smallPnt_1 && point[i] < largePnt_1) isIn = true;
            if(Check(largePnt_1, reverse_distance_1, point[i])) isOut = true;
        }

    //		System.out.println(isIn);
    //		System.out.println(isOut);
        if(isIn && isOut) {
            System.out.println("cross");
        }
        else {
            System.out.println("not cross");
        }
    }

    static Boolean Check(int start, int end, int point) {
        for(int i = 0; i <= end; i++) {
            int num = start + i;
            if(num > 100) {
                num = num - 100;
            }
            if(num == point) {
                return true;
            }
        }
        return false;
    }
}