退竞许久，图灵杯切水题康复训练 #include<bits/stdc++.h> using namespace std;

int n,cnt,maxx=-1,cnt2,len; string s[114514]; string s1,s2;

int main() { cin>>n; while(n--) { cin>>s1>>s2; len=s2.length(); cnt=0; for(int i=0;i<len-2;i++) { if(s2[i]'s'&&s2[i+1]'o'&&s2[i+2]'s') cnt++; } if(cnt>maxx) { maxx=cnt; cnt2=0; s[++cnt2]=s1; } else if(cntmaxx) { s[++cnt2]=s1; } }

for(int i=1;i<=cnt2;i++)
	cout<<s[i]<<" ";
cout<<endl;
cout<<maxx;
return 0;

}