CodeForces - 236A Boy or Girl （模拟）水

75 阅读 0 评论 50 点赞

我是靠谱客的博主阳光帽子，最近开发中收集的这篇文章主要介绍CodeForces - 236A Boy or Girl （模拟）水，觉得挺不错的，现在分享给大家，希望可以做个参考。

概述

CodeForces - 236A

Boy or Girl

Time Limit: 1000MS

Memory Limit: 262144KB

64bit IO Format: %I64d & %I64u

Submit Status

Description

Those days, many boys use beautiful girls' photos as avatars in forums. So it is pretty hard to tell the gender of a user at the first glance. Last year, our hero went to a forum and had a nice chat with a beauty (he thought so). After that they talked very often and eventually they became a couple in the network.

But yesterday, he came to see "her" in the real world and found out "she" is actually a very strong man! Our hero is very sad and he is too tired to love again now. So he came up with a way to recognize users' genders by their user names.

This is his method: if the number of distinct characters in one's user name is odd, then he is a male, otherwise she is a female. You are given the string that denotes the user name, please help our hero to determine the gender of this user by his method.

Input

The first line contains a non-empty string, that contains only lowercase English letters — the user name. This string contains at most 100 letters.

Output

If it is a female by our hero's method, print "CHAT WITH HER!" (without the quotes), otherwise, print "IGNORE HIM!" (without the quotes).

Sample Input

Input

wjmzbmr

Output

CHAT WITH HER!

Input

xiaodao

Output

IGNORE HIM!

Input

sevenkplus

Output

CHAT WITH HER!

Hint

For the first example. There are 6 distinct characters in "wjmzbmr". These characters are: "w", "j", "m", "z", "b", "r". So wjmzbmr is a female and you should print "CHAT WITH HER!".

Source

Codeforces Round #146 (Div. 2)

//题意：

给你一个字符串s,问这个字符串有几个不同的字符，若是奇数个输出IGNORE HIM!，否则输出CHAT WITH HER!

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
int vis[30];
char s[110];
int main()
{
int i,j,l;
while(scanf("%s",s)!=EOF)
{
memset(vis,0,sizeof(vis));
int cnt=0;
l=strlen(s);
for(i=0;i<l;i++)
{
if(!vis[s[i]-'a'])
{
vis[s[i]-'a']=1;
cnt++;
}
}
if(cnt&1)
printf("IGNORE HIM!n");
else
printf("CHAT WITH HER!n");
}
return 0;
}