using namespace std;
typedef long long ll;
int main()
{
ll t;
cin>>t;
ll n;
for(ll T=1;T<=t;T++){
cin>>n;
vector<string>st;
string s;
for(ll i=0;i<n;i++){
cin>>s;
st.push_back(s);
}
string pat;
cin>>pat;
vector<ll>ans;
ll pat_len=pat.size();
for(ll i=0;i<n;i++){
ll pat_ct=0;
s=st[i];
ll s_len=s.size();
for(ll j=0;j<s_len;j++){
if(pat_ct>=pat_len)break;
if(pat[pat_ct]==s[j])pat_ct++;
}
if(pat_ct>=pat_len)ans.push_back(i+1);
}
cout<<"Case "<<T<<":\n";
ll ans_len=ans.size();
for(ll i=0;i<ans_len;i++){
if(i!=0)cout<<" ";
cout<<ans[i];
}
if(ans_len==0)cout<<"No files found!";
cout<<"\n";
}
return 0;
}
Code language: PHP (php)