C 解法, 执行用时: 4ms, 内存消耗: 364KB, 提交时间: 2020-04-21

#include <stdio.h>
#include <string.h>
  
#define MAX_NUM 1001
  
int main()
{
    int nums = 0;
    int longs = 0;
    char slongs[MAX_NUM];
    int needs;
      
    scanf("%d",&nums);
   
    for(int i=0; i<nums; i++)
    {
        scanf("%d",&longs);
        scanf("%s",slongs);
        needs=0;
        for(int j=0;j<longs;)
        {
            if(slongs[j] == 'X')
            {
                j++;
                continue;
            }else{
                needs++;
                j += 3;
            }
        }
        printf("%d\n",needs);
    }
      
      
      
  
      
}

C 解法, 执行用时: 4ms, 内存消耗: 368KB, 提交时间: 2020-03-22

#include <stdio.h>
#include <string.h>
 
#define MAX_NUM 1001
 
int main()
{
    int nums = 0;
    int longs = 0;
    char slongs[MAX_NUM];
    int needs;
     
    scanf("%d",&nums);
  
    for(int i=0; i<nums; i++)
    {
        scanf("%d",&longs);
        scanf("%s",slongs);
        needs=0;
        for(int j=0;j<longs;)
        {
            if(slongs[j] == 'X')
            {
                j++;
                continue;
            }else{
                needs++;
                j += 3;
            }
        }
        printf("%d\n",needs);
    }
     
     
     
 
     
}