A2011 Magic Mirror

文章目录

一、A2011 Magic Mirror

总结

一、A2011 Magic Mirror

本题链接：A2011 Magic Mirror

题目：

Jessie has a magic mirror.

Every morning she will ask the mirror: ‘Mirror mirror tell me, who is the most beautiful girl in the world?’ If the mirror says her name, she will praise the mirror: ‘Good guy!’, but if the mirror says the name of another person, she will assail the mirror: ‘Dare you say that again?’

Today Jessie asks the mirror the same question above, and you are given a series of mirror’s answers. For each answer, please output Jessie’s response. You can assume that the uppercase or lowercase letters appearing anywhere in the name will have no influence on the answer. For example, ‘Jessie’ and ‘jessie’ represent the same person.

Input

The first line contains an integer T(1≤T≤100), which is the number of test cases.

Each test case contains one line with a single-word name, which contains only English letters. The length of each name is no more than 15.

Output

For each test case, output one line containing the answer.

样例输入

2

Jessie

Justin

样例输出

Good guy!

Dare you say that again?

本博客给出本题截图：

AC代码

#include <cstdio>
#include <cstring>
using namespace std;
const int N = 20;
char s[N];
int main()
{
    int n;
    scanf("%d", &n);
    while (n -- )
    {
        scanf("%s", s);
        for (int i = 0; s[i]; i ++ )
            if (s[i] >= 'A' && s[i] <= 'Z')
                s[i] = s[i] - 'A' + 'a';
        if (strcmp(s, "jessie")) puts("Dare you say that again?");
        else puts("Good guy!");
    }
    return 0;
}

总结

这步的操作是让s中所有的字母都变成小写字母，方便我们进行比较

        for (int i = 0; s[i]; i ++ )
            if (s[i] >= 'A' && s[i] <= 'Z')
                s[i] = s[i] - 'A' + 'a';