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:

COMETQ
HVNGAT

ABSTAR
USACO 

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

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:

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;        
}