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

转述：

给出两个字符串（均为大写字母，且长度不超过6）, ‘A’对应数字1, ‘B’对应数字2，依次对应…… ‘Z’对应数字26，算出两个字符串所含字母对应数字乘积，并对47求余，若两者结果相同，输出 “GO”，否则输出 “STAY”。

个人体会

此题是USACO中的第一道编程题，难度不大，主要是让新手了解一下提交文件的格式要求（涉及一些文件输入输出操作）。

源码（已通过）

/*
ID:wayne17
PROG:ride
LANG:C++
*/

#include<iostream>
#include<fstream>
#include<cstring>
#include<cstdio>
#include<string>

using namespace std;
const int maxn = 7; //数组长度一定得大于6

int main()
{
    freopen("ride.in", "r", stdin);//读入文件
    freopen("ride.out", "w", stdout);//输出文件

    char a[maxn],b[maxn];
    cin >> a >> b;
    int ans1 = 1;
    int ans2 = 1;
    int len1 = strlen(a);
    int len2 = strlen(b);
    for(int i = 0; i < len1; i++)
    {
        ans1 = ans1 * (int(a[i]) - 64);
    }
    ans1 = ans1 % 47;

    for(int i = 0; i < len2; i++)
    {
        ans2 = ans2 * (int(b[i]) - 64);
    }
    ans2 = ans2 % 47;

    if (ans1 == ans2)
        cout << "GO" << endl;
    else
        cout << "STAY" <<endl;

    return 0;
}