Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.
Problem hidden on 2013-06-29 15:24:39 by Francky

HIDDENC - Hidden Couple


Problem Statement:

SEEMI is a meritorious student of BUBT. She always loves fantasy. Now she wants to go MALDIVES which is the most beautiful country all over the world& many friends of SEEMI are there. Now she gets an offer from an air lines. The offer is SEEMI can take only a friend from BANGLADESH without paying any ticket cost if and only if his friend name value is divisible by 3(the mysterious number).Read a name and calculate the  value for that name. The value is calculated by adding ASCII values of all of the characters in a name.

Input:

The first line in the data set is an integerT (1<=T<=100) that represents the number of names that follow. Each name is on a separate line.The maximum name length is 70 characters (without any space).

Output:

Print “YES” if her friend can go with her, otherwise print “NO”. All letters should be upper case.
The output is to be formatted exactly like that for the sample output given below.

Sample Input/Output:

Sample Input

Sample Output

 3

 ASHA

 DROGO

 BATMAN

 Case 1: YES

 Case 2: NO

 Case 3: YES

 

___________________________________________________________________________________________________________
Problem Setter: Md. Ashraful Islam Asha, Dept. of CSE

Bangladesh University of Business and Technology (BUBT)

 


Added by:Shipu Ahamed
Date:2013-06-29
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.