int kilkist=0;
      int K=0;
      for(int j=0;j<n;j++)
      {
            for(int f=0;f<strlen(word[j]);f++)
                  if(word[j][f]=='o')
                  {
                        K++;
         if(K==2)
                  {
                        kilkist++;
                  }
   }
      }

Add a code snippet to your website: www.paste.org