P11559 [MX-X7-T0] [LSOT-3] En Ou Ai

Original link: . En Ou Ai is a well-known contest in the "Ou Ai" community. This problem can be used to check whether En Ou Ai has shown its true level. This name is purely fictional and does not refer to any real contest or organization. Any resemblance is purely coincidental.

In one day of En Ou Ai, there are three problems, and the score for each problem is between $0 \sim 100$. Define that when a problem's score is in $85 \sim 100$ (including $85$ and $100$, same below), it is considered approximately accepted; when it is in $45 \sim 84$, it is considered high-score brute force; when it is in $25 \sim 44$, it is considered low-score brute force; when it is in $1 \sim 24$, it is considered exponential brute force; if it is $0$, it is considered a complete zero. An En Ou Ai performance that shows the true level has the following four cases: - One problem is high-score brute force, one problem is low-score brute force, and one problem is exponential brute force. - One problem is approximately accepted, one problem is high-score brute force, and one problem is low-score brute force. - Two problems are approximately accepted, and the remaining one problem is low-score brute force or high-score brute force. - Three problems are approximately accepted. Given a person's scores $a, b, c$ for the three problems in one day of En Ou Ai, determine whether they have shown their true level.

Only one line, three non-negative integers $a, b, c$, representing a person's scores for the three problems in one day of En Ou Ai.

Only one line, a string `Yes` or `No`, indicating whether they have shown their true level.

**Sample Explanation #1** The first problem's score is in $45 \sim 84$, so it is high-score brute force. Similarly, the second problem is high-score brute force, and the third problem is exponential brute force. Because it does not match any of the cases described in the statement, output `No`. **Sample Explanation #2** The first and third problems are approximately accepted, and the second problem is low-score brute force. This satisfies the condition "two problems are approximately accepted and the remaining one is low-score brute force or high-score brute force", so output `Yes`. **Constraints** For all testdata, $0 \le a, b, c \le 100$. Translated by ChatGPT 5