OJ【3083】 寻找helloworld

题目链接:【3083】 寻找helloworld

题意:找寻字符串能组成的helloworld的总数 纯水题 用各字母做下标 每次重置 找出最小数 要注意l/3 o/2 还有多组输出

输入样例:

2
worheldollaaaa
worheldollworheldolleeee

输出样例:

1
2

代码如下:

#include 
   
   
    
    
#include 
    
    
     
     

using namespace std;
/*
*
*helloworld h e l/3 o/2 w r d
*
*/

int num[300];

void init()
{
    num['h']=num['e']=num['l']=num['o']=num['w']=num['r']=num['d']=0;
}

int comp()
{
    int Min = 1000;

    if(num['h'] < Min) Min = num['h'];
    if(num['e'] < Min) Min = num['e'];
    if(num['l']/3 < Min) Min = num['l']/3;
    if(num['o']/2 < Min) Min = num['o']/2;
    if(num['w'] < Min) Min = num['w'];
    if(num['r'] < Min) Min = num['r'];
    if(num['d'] < Min) Min = num['d'];

    return Min;
}

int main()
{
    ios::sync_with_stdio(false);
    int T,len,i;
    char w[10001];
    cin>>T;
    while(T--)
    {
        init();
        cin>>w;
        len=strlen(w);
        for(i=0;i