HackerEarth Zoos problem solution

In this HackerEarth Maximum borders problem solution, you are required to enter a word that consists of x and y that denote the number of Zs and Os respectively. The input word is considered similar to word zoo if 2 x x = y.

Determine if the entered word is similar to word zoo. For example, words such as zzoooo and zzzoooooo are similar to word zoo but not the words such as zzooo and zzzooooo.

HackerEarth Zoos problem solution.

#include <bits/stdc++.h>
using namespace std;

const int maxn = 5e5 + 17;
string s;
int main(){
	ios::sync_with_stdio(0), cin.tie(0);
	cin >> s;
	cout << (count(s.begin(), s.end(), 'z') * 2 == count(s.begin(), s.end(), 'o') ? "Yes" : "No") << '\n';
}