CF #230 (Div. 2) A

看了半天没看懂啥意思- -

后来想明白了，随便排列已经出现的字母，并且nineteen可以首尾相接，省略一些个n

A. Nineteen

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Alice likes word "nineteen" very much. She has a string s and wants the string to contain as many such words as possible. For that reason she can rearrange the letters of the string.

For example, if she has string "xiineteenppnnnewtnee", she can get string "xnineteenppnineteenw", containing (the occurrences marked) two such words. More formally, word "nineteen" occurs in the string the number of times you can read it starting from some letter of the string. Of course, you shouldn't skip letters.

Help her to find the maximum number of "nineteen"s that she can get in her string.

Input

The first line contains a non-empty string s, consisting only of lowercase English letters. The length of string s doesn't exceed 100.

Output

Print a single integer — the maximum number of "nineteen"s that she can get in her string.

Sample test(s)

input

nniinneetteeeenn

output

2

input

nneteenabcnneteenabcnneteenabcnneteenabcnneteenabcii

output

2

input

nineteenineteen

output

2
#include <cstdio>
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <fstream>
#include <math.h>
#include <queue>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;
char s[500];
int n;
int i;
int e;
int t;

int main()
{
	//freopen ("input.txt","r",stdin);
	gets(s);
	int l=strlen(s);
	for(int j=0;j<l;j++){
		if(s[j]=='n') n++;
		else if (s[j]=='i') i++;
		else if (s[j]=='e') e++;
		else if (s[j]=='t') t++;
	}
	e=e/3;
	int minn=INF;
	if(minn>i) minn=i;
	if(minn>e) minn=e;
	if(minn>t) minn=t;
	if(minn>0&&n>=3){
		minn;
		n=n-3;
		n=n/2;
		n++;
		if(minn>n) minn=n;
		cout <<minn<<endl;
	}
	else {
		cout<<0<<endl;
	}
	return 0;
}