Your Ride Is Here
#描述#
It is a well-known fact that behind every good comet is a UFO. These UFOs often come to collect loyal supporters
from here on Earth. Unfortunately, they only have room to pick up one group of followers on each trip. They do,
however, let the groups know ahead of time which will be picked up for each comet by a clever scheme: they pick a
name for the comet which, along with the name of the group, can be used to determine if it is a particular group's
turn to go (who do you think names the comets?). The details of the matching scheme are given below; your job is to
write a program which takes the names of a group and a comet and then determines whether the group should go with the
UFO behind that comet.
Both the name of the group and the name of the comet are converted into a number in the following manner: the final
number is just the product of all the letters in the name, where "A" is 1 and "Z" is 26. For instance, the group "USACO"
would be 21 * 19 * 1 * 3 * 15 = 17955. If the group's number mod 47 is the same as the comet's number mod 47, then you
need to tell the group to get ready! (Remember that "a mod b" is the remainder left over after dividing a by b; 34 mod 10
is 4.)
Write a program which reads in the name of the comet and the name of the group and figures out whether according to the
above scheme the names are a match, printing "GO" if they match and "STAY" if not. The names of the groups and the comets
will be a string of capital letters with no spaces or punctuation, up to 6 characters long.
Input Output
COMETQ GO
HVNGAT
ABSTAR STAY
USACO
#格式#
##输入格式##
There are more than one cases.
Every case contain two lines:
Line 1: An upper case character string of length 1..6 that is the name of the comet.
Line 2: An upper case character string of length 1..6 that is the name of the group.
There is an empty line after each case.
##输出格式##
A line containing either the word "GO" or the word "STAY".
#样例1#
##样例输入1##
COMETQ
HVNGAT
ABSTAR
USACO
##样例输出1##
GO
STAY
#限制#
1000ms
32768KB
#提示#
#来源#