【BZOJ】【P2295】【POJ Challenge】【我爱你啊】【题解】【水题】

传送门:http://www.lydsy.com/JudgeOnline/problem.php?id=2295

傻逼题

Code:

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1e5+5;
int n;
char s[maxn];
char t[]="luvletter";
int main(){
	scanf("%d",&n);getchar();
	while(n--){
		gets(s+1);
		int len=strlen(s+1);
		int ans=0;
		for(int i=1,j=0;i<=len;i++){
			j+=s[i]==t[j];
			if(j==9)j=0,ans++;
		}printf("%d\n",ans);
	}
	return 0;
}