uva-644

细节，水题，不说了

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define maxn 5000
using namespace std;

string s[maxn];
int i=0,t=0;

void input()
{
    while(!getline(cin,s[i++]).eof())
    {
        while(getline(cin,s[i])&&s[i][0]!='9')i++;
        int flag=0;
        for(int j=0;j<i;j++)
        {
            int lenj=s[j].length();
            for(int k=j+1;k<i;k++)
            {
                int lenk=s[k].length(),l;
                for( l=0;l<lenj&&l<lenk;l++)
                {
                    if(s[j][l]==s[k][l]);
                    else break;
                }
                if(l==lenj||l==lenk)flag=1;
            }
        }
        if(flag)cout<<"Set "<<++t<<" is not immediately decodable"<<endl;
        else cout<<"Set "<<++t<<" is immediately decodable"<<endl;
        i=0;
    }
}

int main()
{
    input();
    return 0;
}