The first try of USACO

转载

mb5fdb0a1b25659 2021-08-02 17:02:00

文章标签 ide sed #include c++11 c代码 文章分类 代码人生

关于USACO的初次尝试

关于USACO的初次尝试

Your Ride Is Here
PROGRAM NAME: ride
AC代码
Tips:

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.

先给出代码：

AC代码

/*
PROG:ride
LANG:C++11
*/
#include <iostream>
#include <fstream>
#include <cstring>

using namespace std;
char str1[10001],str2[10001];

int judge(char a[]) {
int len = strlen(a);
int num = 1;
for (int i=0;i<=len;i++) {
int t = a[i]-'A'+1;
num = (num*t)%47;
    }
return num;
}

int main() {
ofstream fout("ride.out");
ifstream fin("ride.in");
fin >> str1 >> str2;
if (judge(str1)==judge(str2))
fout << "GO" << endl;
else 
fout << "STAY" << endl;
return 0;
}