np-hard (3 курс, 2024) - Appropriate applicant

Problem A. Appropriate applicant ≡

problems
visible spaces
basic formulae
wide text
editor
en ru

Author:	Антон Карабанов	Time limit:	1 sec
Input file:	Standard input	Memory limit:	256 Mb
Output file:	Standard output

Statement

Hawk-nose started counting his fingers. "We need a programmer who: a — is not spoiled; b — is a volunteer; c — is willing to live in a dorm."

—And how about wings?" I asked. "Or, say, a halo around the head? You are searching for one in a thousand!"

— "But all we need is just that one," said Hawk-nose.

Arkady and Boris Strugatsky, "Monday begins on Saturday", 1964 г.

Employees of the Research Institute of Advanced Technologies encountered a group of programmers in the forest. It turned out that exactly a percent of them are inexperienced, b percent are volunteers, and c percent are willing to live in a dormitory. Determine the minimum possible number of people in such a group and whether there is guaranteed to be at least one programmer with all three necessary qualities.

Input format

Three lines of input contain three natural numbers: a, b and c.

Output format

Output a single natural number in the first line. In the second line, output Yes or No — answers to the questions of the problem.

Constraints

1 ≤ a, b, c ≤ 99

Explanation of the examples

In the first example, the minimum possible number of people will be 20, for which all the specified percentages will be integers (4, 5, and 6). However, it's possible that different people possess the required qualities.

In the second example, the minimum possible number of people will be 4, and regardless of attempts to distribute the specified qualities among them, there will definitely be at least one person with all three.

Sample tests

No.	Standard input	Standard output
1	`20 25 30`	`20 No`
2	`75 75 75`	`4 Yes`