Computer scienceProgramming languagesJavaBasicsControl flow statements

Conditional statement

Theory

Chocolate

Report a typo

Wow! This problem is kind of tricky. If you're ready to put your thinking cap on, brace yourself and good luck! Otherwise, you can skip it for now and return any time later

Imagine a chocolate bar. Remember how it is usually split into smaller bits by a special grid?

Now think of chocolate as an N x M rectangle divided into little segments: N segments in width and M in height. Each segment is 1x1 and unbreakable. Find out whether it is possible to break off exactly K segments from the chocolate with a single straight line: vertical or horizontal.

Input data format

The program gets an input of three integers: N, M, K.

Output data format

The program must output one of the two words: YES or NO.

If you're having trouble understanding the task, try drawing it on a piece of paper.

Valid and invalid ways to split chocolate grid

Sample Input 1: 

4
2
6

Sample Output 1: 

YES

Sample Input 2: 

2
10
7

Sample Output 2: 

NO

Sample Input 3: 

7
4
21

Sample Output 3: 

YES
Write a program in Java 17
import java.util.Scanner;

class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
// start coding here
}
}
___

Create a free account to access the full topic