light oj 1338 - Hidden Secret!

1338 - Hidden Secret!

PDF (English)

Statistics

Forum

Time Limit: 1 second(s)

Memory Limit: 32 MB

In this problem you are given two names, you have to find whether one name is hidden into another. The restrictions are:

1.      You can change some uppercase letters to lower case and vice versa.

2.      You can add/remove spaces freely.

3.      You can permute the letters.

And if two names match exactly, then you can say that one name is hidden into another.

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with two lines. Each line contains a name consists of upper/lower case English letters and spaces. You can assume that the length of any name is between 1 and 100 (inclusive).

Output

For each case, print the case number and "Yes" if one name is hidden into another. Otherwise print "No".

Sample Input	Output for Sample Input
3 Tom Marvolo Riddle I am Lord Voldemort I am not Harry Potter Hi Pretty Roar to man Harry and Voldemort Tom and Jerry and Harry	Case 1: Yes Case 2: Yes Case 3: No

 开始理解错了，后来才知道两行的字母完全一样就行，不分大小写和顺序。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int main()
{
    char str1[110],str2[110];
    int t,k=1;
    int len1,len2;
    scanf("%d",&t);
    getchar();
    while(t--)
    {
        gets(str1);
        gets(str2);
        len1=strlen(str1);
        len2=strlen(str2);
        int a[30]={0};
        int b[30]={0};
        for(int i=0;i<len1;i++)
        {
            if(str1[i]!=' ')
            {
                if(str1[i]>='a'&&str1[i]<='z')
                    str1[i]-=32;
                ++a[str1[i]-'A'];
            }
        }
        for(int i=0;i<len2;i++)
        {
            if(str2[i]!=' ')
            {
                if(str2[i]>='a'&&str2[i]<='z')
                    str2[i]-=32;
                ++b[str2[i]-'A'];
            }
        }
        int flag=0;
        for(int i=0;i<26;i++)
        {
            if(a[i]!=b[i])
            {
                flag=1;break;
            }
        }
        if(!flag)
            printf("Case %d: Yes\n",k++);
        else
            printf("Case %d: No\n",k++);
    }
    return 0;
}