Competitive-Programming/nineteen.cpp at master · Code-Cube-NITP/Competitive-Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include<bits/stdc++.h>
#definefastioios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#defineendl'\n'
#defineintlonglongint
usingnamespacestd;
#definepii pair <int, int>
#definemii map<int, int>
#definepb push_back
#definedeb(x) cout << #x << "" << x << endl
#definedeb2(x, y) cout << #x << "" << x << "" << #y << "" << y << endl
#defineLoop(s, e, itr) for (int itr = s; itr < e; itr++)
#defineloop(n) for(int i = 0; i < n; i++)
#definevin vector<int>
#definevec vector
#definew(t) int tc; cin >> tc; for(int t = 1; t <= tc; t++)
#definemk_arr(n, t, s) t* n = new t[s]; loop(s) cin >> n[i];
#definemi_arr(n, s) int* n = newint[s]; loop(s) cin >> n[i];
#definearr_out(n, s) Loop(0, s, lout) cout << n[lout] << "";
#definepi(x) printf("%lld ", x);
#definemod1000000007


int32_tmain(){
 string str;
 cin >> str;
int n, i, t, e;
 n = i = t = e = 0;
int len = str.length();
for(auto j: str){
switch (j)
 {
case'n':
 n++;
break;
case'i':
 i++;
break;
case't':
 t++;
break;
case'e':
 e++;
break;
 }
 }
if(!(n%2)) n--;
 n /= 2;
 e /= 3;
 cout << min(i, min(n, min(t, e))) << endl;
}