HDU

Bazinga

题目传送门

#include <iostream>#include <fstream>#include <cstdio>#include <cstring>#include <queue>#include <stack>#include <vector>#include <map>#include <set>#include <cmath>#include <algorithm>#include <functional>#define inf 0x3f3f3f3fusing namespace std;typedef long long ll;const int MAXN=1e5+10;const int MAX=1e4+10;const double eps=1e-6;int n;char s[600][MAX];int vis[600];int main(){    #ifdef ONLINE_JUDGE    #else    freopen("in.txt","r",stdin);    //freopen("out.txt","w",stdout);    #endif    int T,flag=1;    cin>>T;    while(T--){        printf("Case #%d: ",flag++);        memset(vis,0,sizeof(vis));        int ans=0;        cin>>n;        for(int i=1;i<=n;i++){            cin>>s[i];        }        int juge=0;        for(int i=1;i<=n;i++){            for(int j=1;j<i;j++){                if(vis[j])  continue;                if(strstr(s[i],s[j])==0){                    ans=i;juge=1;                }                else                    vis[j]=1;            }        }        if(juge)            cout<<ans<<endl;        else            cout<<-1<<endl;    }    return 0;   }