USACO-Your Ride Is Here（你的飞碟在这儿）-Section1.2<1>

【英文原题】

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.

Examples:

 

Input	Output
COMETQ HVNGAT	GO
ABSTAR USACO	STAY

PROGRAM NAME: ride

This means that you fill in your header with:
PROG: ride
WARNING: You must have 'ride' in this field or the wrong test data (or no test data) will be used.

INPUT FORMAT

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.

NOTE: The input file has a newline at the end of each line but does not have a "return". Sometimes, programmers code for the Windows paradigm of "return" followed by "newline"; don't do that! Use simple input routines like "readln" (for Pascal) and, for C/C++, "fscanf" and "fid>>string".

NOTE 2: Because of the extra characters, be sure to leave enough room for a 'newline' (also notated as '\n') and an end of string character ('\0') if your language uses it (as C and C++ do). This means you need eight characters of room instead of six.

SAMPLE INPUT (file ride.in)

COMETQ
HVNGAT

OUTPUT FORMAT

A single line containing either the word "GO" or the word "STAY".

SAMPLE OUTPUT (file ride.out)

GO

OUTPUT EXPLANATION

Converting the letters to numbers:

C	O	M	E	T	Q
3	15	13	5	20	17
H	V	N	G	A	T
8	22	14	7	1	20

then calculate the product mod 47:

3 * 15 * 13 * 5 * 20 * 17 = 994500 mod 47 = 27
8 * 22 * 14 * 7 *  1 * 20 = 344960 mod 47 = 27

Because both products evaluate to 27 (when modded by 47), the mission is 'GO'.

【中文翻译】

题目描述

众所周知，在每一个彗星后都有一只UFO。这些UFO时常来收集地球上的忠诚支持者。不幸的是，他们的飞碟每次出行都只能带上一组支持者。因此，他们要用一种聪明的方案让这些小组提前知道谁会被彗星带走。他们为每个彗星起了一个名字，通过这些名字来决定这个小组是不是被带走的那个特定的小组（你认为是谁给这些彗星取的名字呢？）。关于如何搭配的细节会在下面告诉你；你的任务是写一个程序，通过小组名和彗星名来决定这个小组是否能被那颗彗星后面的UFO带走。

小组名和彗星名都以下列方式转换成一个数字：最终的数字就是名字中所有字母的积，其中“A”是1，“Z”是26。例如，“USACO”小组就是21*19*1*3*15=17955。如果小组的数字 mod 47等于彗星的数字mod 47,你就得告诉这个小组需要准备好被带走！（记住“a mod b”是a除以b的余数；34 mod 10等于4）

写出一个程序，读入彗星名和小组名并算出用上面的方案能否将两个名字搭配起来，如果能搭配，就输出“GO”，否则输出“STAY”。小组名和彗星名均是没有空格或标点的一串大写字母（不超过6个字母）。

输入输出格式

输入格式：

第1行：一个长度为1到6的大写字母串，表示彗星的名字。

第2行：一个长度为1到6的大写字母串，表示队伍的名字。

输出格式：

输入输出样例

输入样例#1： 

COMETQ
HVNGAT

输出样例#1： 

GO

输入样例#2： 

ABSTAR
USACO

输出样例#2： 

STAY

思路：为了满足题意，首先要将两个字符串转换为数字，然后两个字符串分别对47取余，判断取余后两数是否相等，相等输出GO，不相等输出STAY。

代码如下：

#include <stdio.h>      
#include <string.h>      
int main()      
{      
    char a[3000],s[3000];     
    int a1,s1,a2=1,s2=1;   
    int i;  
    scanf("%s%s",a,s);  
    a1=strlen(a);//测字符串a长度        
    s1=strlen(s);//测字符串s长度     
    for(i=0;i<a1;i++) a2*=a[i]-'A'+1;//转换成数字a2         
     for(i=0;i<s1;i++) s2*=s[i]-'A'+1;//转换成数字s2  
    if(a2%47==s2%47)//取余后相等，输出GO  
    printf("GO\n");  
    else printf("STAY\n");//否则输出STAY
    return 0;          
}