We have a block of chocolate with n * m dimensions (of pieces of chocolate!). This method determines if it is possible to break off exactly K segments from the chocolate with a single straight line: vertical or horizontal. The program gets an input of three integers: n, m, k.

Main.java

import java.util.Scanner;

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

        int n = scanner.nextInt();
        int m = scanner.nextInt();
        int k = scanner.nextInt();

        if (k > (n * m)) {
            System.out.print("NO");
        } else {
            if (k % n == 0 && k >= n || k % m == 0 && k >= m) {
                System.out.print("YES");
            } else {
                System.out.print("NO");
            }
        }
    }
}