제출 #94710

#제출 시각아이디문제언어결과실행 시간메모리
94710AKaan37Magnus (COCI18_magnus)C++17
50 / 50
6 ms508 KiB
#include <bits/stdc++.h>

using namespace std;

typedef long long int lo;
typedef pair<int,int> PII;

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define FOR for(int i=1;i<=  n;i++)
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define mid (start+end)/2

const lo mod = 1000000007;
const lo li = 100005;
const lo inf = 1000000000;
const lo MAX = 1000000000000000000;
const lo MIN = -1000000000000000000;
const lo LOG = 30;

lo n,m,cev,ok;
string s;

int main(){
	cin>>s;
	n=s.size();
	for(lo i=0;i<n;i++){
		if(s[i]=='H' && ok==0) ok++;
		if(s[i]=='O' && ok==1) ok++;
		if(s[i]=='N' && ok==2) ok++;
		if(s[i]=='I' && ok==3){ok=0;cev++;}
	}
	cout<<cev<<endl;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...