133A - HQ9+ - CodeForces Solution


implementation *900

Please click on ads to support us..

Python Code:

lan = input()
print('YES' if 'H' in lan or 'Q' in lan or '9' in lan else 'NO')

C++ Code:

#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
typedef long long ll;
typedef long double ld;
#define pb(a) push_back(a);
#define max3(a,b,c) max(max(a,b),c)
#define max4(a,b,c,d) max(max(a,b),max(c,d))
#define fr(i,k,n) for(ll i=0;i<k;i++)
ll t,q,n,m,w,h,k,l,r,x,a,b,c,y,d,i,j,f,g,count,nl,np,p;
int main() {
fastio;
string s;
cin>>s;
ll temp=-1;
for(i=0;i<s.length();i++)
{
    if(s[i]=='H'||s[i]=='Q'|| s[i]=='9')
    {temp++;
        cout<<"YES"<<endl;
        break;
}}
if(temp==-1)
cout<<"NO"<<endl;}


Comments

Submit
0 Comments
More Questions

1461A - String Generation
1585B - Array Eversion
1661C - Water the Trees
1459A - Red-Blue Shuffle
1661B - Getting Zero
1661A - Array Balancing
1649B - Game of Ball Passing
572A - Arrays
1455A - Strange Functions
1566B - MIN-MEX Cut
678C - Joty and Chocolate
1352E - Special Elements
1520E - Arranging The Sheep
1157E - Minimum Array
1661D - Progressions Covering
262A - Roma and Lucky Numbers
1634B - Fortune Telling
1358A - Park Lighting
253C - Text Editor
365B - The Fibonacci Segment
75A - Life Without Zeros
1519A - Red and Blue Beans
466A - Cheap Travel
659E - New Reform
1385B - Restore the Permutation by Merger
706A - Beru-taxi
686A - Free Ice Cream
1358D - The Best Vacation
1620B - Triangles on a Rectangle
999C - Alphabetic Removals