-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1850A_To_My_Critics.cpp
More file actions
65 lines (58 loc) · 1.67 KB
/
Copy path1850A_To_My_Critics.cpp
File metadata and controls
65 lines (58 loc) · 1.67 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/* A. To My Critics
time limit per test 1 second
memory limit per test 256 megabytes
Suneet has three digits a, b, and c.
Since math isn't his strongest point, he asks you to determine if you can choose any two digits to make a sum greater or equal to 10.
Output "YES" if there is such a pair, and "NO" otherwise.
Input
The first line contains a single integer t (1≤t≤1000) — the number of test cases.
The only line of each test case contains three digits a, b, c (0≤a,b,c≤9).
Output
For each test case, output "YES" if such a pair exists, and "NO" otherwise.
You can output the answer in any case (for example, the strings "yEs", "yes", "Yes" and "YES" will be recognized as a positive answer).
Example
Input:
5
8 1 2
4 4 5
9 9 9
0 0 0
8 5 3
Output:
YES
NO
YES
NO
YES
Note:
For the first test case, by choosing the digits 8 and 2 we can obtain a sum of 8+2=10 which satisfies the condition, thus the output should be "YES".
For the second test case, any combination of chosen digits won't be at least 10, thus the output should be "NO" (note that we can not choose the digit on the same position twice).
For the third test case, any combination of chosen digits will have a sum equal to 18, thus the output should be "YES".
*/
#include<bits/stdc++.h>
using namespace std;
int t,n,i,j;
void solve(){
int a,b,c;
cin>>a>>b>>c;
if(a+b>=10){
cout<<"Yes\n";
}
else if(b+c>=10){
cout<<"Yes"<<endl;
}
else if(a+c>=10){
cout<<"Yes\n";
}
else{
cout<<"No"<<endl;
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>t;
while(t--){
solve();
}
}