原題：

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'. 

網址：http://train.usaco.org/usacoprob2?a=L06MbLFzLFN&S=ride

大意（自己翻譯的）：

給出兩個只含大寫字母，長度小於等於6的字元串，如果它們最後轉化成的數字對47取模後相等則輸出“GO”，不然輸出“STAY”。註意：輸出的最後需要換行！

轉化成的數字計算方法：將每個字母對應的數字（A對應1，B對應2...）相乘紀委這個字元串轉化成的數字。

樣例輸入：

  COMETQ

  HVNGAT

樣例輸出：

  GO

有沒有感覺翻譯很水？叫你自己不學好英語！自己去原頁面上看看就行了嘛！

題解（自己寫的）：

就是簡單的模擬，要註意吃回車：

getline(fin,s);

代碼如下：

 1 /*
 2 ID:被和諧了
 3 PROB:ride
 4 LANG:C++
 5 */
 6 #include<bits/stdc++.h>
 7 using namespace std;
 8 
 9 string s;
10 int work(string x)
11 {
12     int t=1;
13     for (int i=0;i<x.length();i++) t*=x[i]-'A'+1,t%=47;
14     return t;
15 }
16 
17 int main()
18 {
19     int a,b;
20     
21     ifstream fin ("ride.in");
22     ofstream fout ("ride.out");
23 
24     getline(fin,s);
25     a = work(s);
26     getline(fin,s);
27     b = work(s);
28     if (a==b) fout<<"GO"; else fout<<"STAY";
29 
30     return 0;
31 }

有問題請聯繫作者，謝謝！