Codeforces Round #230 (Div. 2) problem A(小算数)

题目链接：点击打开链接

题目分析：求一串字符中nineteen的个数

注意：n，i,t,e的数量关系

#include<cstdio>#include<algorithm>#include<cstdlib>#include<cstring>#include<cmath>using namespace std;char str[105];int length;int find (char c)//统计字符c出现的次数{    int count=0;    for(int i=0;i<length;i++)    {        if(str[i]==c) count++;    }return count;}int solve(){    int ans=0;    int n=find('n'),i=find('i'),e=find('e'),t=find('t');    t=i=min(i,t);    if(e>=i*3)//数量关系    {        if(n>=2*i+1)        return i;        else        return (n-1)/2;    }    else    {        return min(e/3,(n-1)/2);    }    return 0;}int main(){    while(scanf("%s",str)!=EOF)    {        length=strlen(str);        printf("%d\n",solve());    }    return 0;}