2018焦作网络赛A

#include <bits/stdc++.h>
#include <unordered_set>
#include <unordered_map>
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define rep(i,x,y) for(i=x;i<=y;i++)
#define rep1(i,x,y) for(i=x;i<y;i++)
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define up rt,rt<<1,rt<<1|1
#define mem(x) memset(x,0,sizeof(x))
#define mem1(x) memset(x,-1,sizeof(x))
using namespace std;
typedef long long ll;
typedef double db;
const int M = 1e5+7;
const double pi = acos(-1);
const int inf = 2147483647;
const int mod = 1e9+7;

int _;
char s[40];

int main(){
    #ifdef LMissher
        freopen("1.in","r",stdin);
        freopen("1.out","w",stdout);
    #endif
    scanf("%d",&_);
    while(_--){
        scanf("%s",s);
        int l=strlen(s);
        for(int i=0;i<l;i++)
            if(s[i]>=‘A‘&&s[i]<=‘Z‘)
                s[i]=s[i]-‘A‘+‘a‘;
        if(strcmp(s,"jessie")==0) printf("Good guy!\n");
        else printf("Dare you say that again?\n");
    }
    return 0;
}