Problem - 236A Boy or Girl


 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#include <string>
#include <vector>
#include <cmath>
#include <cctype>
#include <sstream>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#define sf scanf
#define pf printf
#define sfint scanf ("%d %d",&a,&b)
#define sfl scanf ("%ld %ld",&a,&b)
#define sfll scanf ("%lld %lld",&a,&b)
#define sfd scanf ("%lf %lf",&a,&b)
#define sff scanf ("%f %f",&a,&b)
#define lp1(i,n) for(i=0;i<n;i++)
#define lp2(i,n) for(i=1;i<=n;i++)
#define LL long long
#define L long
#define mem(c,v) memset(c,v,sizeof(c))
#define ui unsigned int
#define ull unsigned long long int
#define nl puts("")
#define sq(x) ((x)*(x))
#define MX 1000005
#define N 100
#define MOD 10000000007
#define pb push_back
#define pi acos(-1.0)
#define sz size()
#define gc getchar ()
#define ps push
#define clr clear
#define bn begin()
#define ed end()

using namespace std;

int main()
{
    string s;
    set<char>st;
    set<char> :: iterator it;
    while(cin >> s)
    {
        int len=s.size(),i,cnt=0;

        for(i=0;i<len;i++)
        {
            st.insert(s[i]);
        }

        for(it=st.begin();it!=st.end();++it)
        {
            //cout << *it << " ";
            cnt++;
        }

        if(!(cnt&1))
        {
            pf("CHAT WITH HER!\n");
        }

        else
        {
            pf("IGNORE HIM!\n");
        }

        st.clear();
    }

    return 0;
}



Comments

Popular posts from this blog

SPOJ-CMG - Collecting Mango

LeetCode Palindrome Number

Hacker Rank The Power Sum