Sahil loves gfg.cpp

/*Sahil is done with his internship and now it's time to attend Geeks Classes to enhance knowledge of Data Structures. However, to join this class, he has been given a task to complete. The task is to count the occurrences of "gfg" in the given string, and if he completes this task, he qualifies for Geeks Classes. But, Sahil is facing some problem in solving this task, so help him.
Input : 
First line of input contains "T" testcases. Next "T" lines contains Strings with lowercase characters.
Output : 
For each testcase, output the count the ccurrences of "gfg"(continuous) present in string.
Constraints : 
1 <= T <= 10
1<= length_of_string <= 100
Example :
Input :
2
geefgfgksforgfgeeks
dsajslsdlsfgf
Output :
2
-1
Explanation :
#Test Case 1: In the first testcase, "gfg" occurs two times in the String. First ccurrence starts at index 4 and next starts at 12.
#Test Case 2: In second testcase, there is no occurences of "gfg" in given string. So, it returned -1. */
//SUMIT KUMAR

#include<iostream>
using namespace std;
int main()
{
   int T;
   cin>>T;
   while(T--)
   {
       string s;
       cin>>s; 
       int count=0;
       for(int i=0;i<s.size();i++)
       {
           if ((i<s.size()-2) && s[i]=='g'&&s[i+1]=='f'&&s[i+2]=='g')
           {
               count++;
           }
       }
       if(count)
       cout<<count<<endl;
       else 
       cout<<"-1"<<endl;
   }
   return 0;
}