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 |
|
GO |
|
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'.
以上是原题，题目大意：
从文件读取两个字符串（小组与彗星），将字符串转换为每个字符所对应的数字的乘积（“A”是1, “B”是2，···，“Z”是26。例如, “USACO”组将是21 * 19 * 1 * 3 * 15 = 17955。）如果这两个乘积除以47的余数相同，就输出“GO”到文件，否则输出“STAY”
注意：这组和彗星的名字将是一串大写字母, 没有空格或标点符号, 最长6个字符。
贴上代码（ C ）
/*
ID: xyj11361
LANG: C
TASK: ride
*/
#include <stdio.h>
#include <stdlib.h>
int main()
{
char a[7], b[7]; //分别用来存两个字符
int m=1, n=1; //分别用来存字符转化过来的数字
int i; //临时变量
freopen("ride.in","r",stdin); //读文件
freopen("ride.out","w",stdout);
scanf("%s",a); //读字符串
scanf("%s",b);
for(i=0;a[i];i++) //转化为数字 ，‘A’对应的ASCII码为65
m*=a[i]-64;
for(i=0;b[i];i++) //a[i] 相当于 if(a[i]!='\0') 继续执行循环
n*=b[i]-64;
if(m%47 == n%47) //按题意进行比较
printf("GO\n"); //输出
else
printf("STAY\n");
return 0;
}