minimum flip

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

int bulbs(int a[],int n)
{
	int count = 0;

	int res = 0;
	for (int i = 0; i < n; i++)
	{
		
		
		
		if (a[i] == 1 && count % 2 == 0)
			continue;

		
		
		
		else if(a[i] == 0 && count % 2 != 0)
			continue;

		
		
		
		
		else if (a[i] == 1 && count % 2 != 0)
		{
			res++;
			count++;
		}
		
		
		
		
		
		else if (a[i] == 0 && count % 2 == 0)
		{
			res++;
			count++;
		}
	}
	return res;
}
int main()
{
	int states[] = {1,1,0,0,1,1,0,1,1,1};
	int n = sizeof(states)/sizeof(states[0]);
	cout << "The minimum number of switches needed are " << bulbs(states,n);
}