46C. Hamsters and Tigers - Codeforces Solution C++

➤  Problem Link : 46C. Hamsters and Tigers 

✅ C++ Solution :

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

#define ll long long int

int main()
{
	int n;
	cin>>n;
	string s;
	cin>>s;
	int hc=0;
	for(auto c: s)
		if(c=='H')
			hc++;
	int ans=INT_MAX,curr;
	
	for(int i=0;i<=hc;i++)
	{	
		curr=0;
		for(int j=0;j<n;j++)
		{
			if(j<i)
			{
				if(s[j]=='T')
					curr++;
			}
			else if(j>=n-(hc-i))
			{
				if(s[j]=='T')
					curr++;
			}
		}
		ans=min(ans,curr);

	}	
	
	int tc=n-hc;
	for(int i=0;i<=tc;i++)
	{	
		curr=0;
		for(int j=0;j<n;j++)
		{
			if(j<i)
			{
				if(s[j]=='H')
					curr++;
			}
			else if(j>=n-(tc-i))
			{
				if(s[j]=='H')
					curr++;
			}
		}
		ans=min(ans,curr);

	}	
	
	
	cout<<ans;
}

 

Thank you for your patience reading. If you enjoyed this post, I’d be very grateful if you’d help it spread by emailing it to a friend, or sharing it on Whatsapp or Facebook. 

😇Happy Learning!!

• Tweet
• Share
• Share
• Share
• Share

About Utkarsh Gupta

I am a Member Technical at D.E. Shaw India Pvt. Ltd. CodingWithArt is a blog where you find tricks and solutions to challenging coding and development problems. I aim to build a universal tech platform for every enthusiast out there.