Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
SnackDown 2021
Lucky Number
Chef buys a lottery ticket that has a 3 digit code associated with it. He thinks that digit 7 is his lucky digit and brings him good luck. Chef will win some amount in the lottery if at least one of the digits of the lottery ticket is 7.
Given three digits A, B, and C of the lottery ticket, tell whether Chef wins something or not?
First line will contain T, the number of test cases. Then the test cases follow.
Each test case contains a single line of input, three space separated integers A,B,C.
For each testcase, output in a single line answer "YES" if Chef wins a positive amount with the lottery and "NO" if not.
You may print each character of the string in uppercase or lowercase (for example, the strings "yEs", "yes", "Yes" and "YES" will all be treated as identical).
1≤T≤1000
0≤A,B,C≤9
3
0 0 0
7 8 9
2 7 7
NO
YES
YES
Test Case 1: Since no digit is equal to 7, Chef fails to win any amount in the lottery.
Test Case 2: Since the first digit is equal to 7, Chef will win some amount in the lottery.
Test Case 3: Since the second and third digit is equal to 7, Chef will win some amount in the lottery.