TJU Problem 2101 Bullseye

注意代码中：

　　result1 << " to " << result2 << ", PLAYER 1 WINS."<< endl;

和

　　result1 << " to " << result2 << ", PLAYER 1 WINS. "<< endl;

虽然只在WINS后只差一个空格，但会导致PE。

原题：

2101.   Bullseye

A simple dartboard consists of a flat, circular piece of cork with concentric
rings drawn on it. Darts are thrown at the board by players in an attempt to hit
the center of the dartboard (the Bullseye). The region between each pair
of rings (or the center and the first ring) represents a certain point value.
The closer the region is to the center of the dartboard, the more points the
region is worth, as shown in the diagram below:

Ring radii are at 3", 6", 9", 12" and 15" (the Bullseye has a diameter
of 6"). A game of Simple Darts between two players is played as follows.
The first player throws 3 darts at the board. A score is computed by adding up
the point values of each region that a dart lands in. The darts are removed. The
second player throws 3 darts at the board; the score for player two is computed
the same way as it is for player one. The player with the higher score wins.

For this problem, you are to write a program that computes the scores for two
players, and determine who, if anyone, wins the game. If a dart lands exactly on
a ring (region boundary), the higher point value is awarded. Any dart outside
the outer ring receives no points. For the purposes of this problem, you can
assume that a dart has an infinitely fine point and can not land
partially on a ring; it is either on the ring or it is not
on the ring. Standard double precision floating point operations will be
should be used.

Input

Input consists of 1 or more datasets. A dataset is a line with 12
double-precision values separated by spaces. Each pair of values represents the
X and Y distances respectively of a dart from the center of the board in inches.
(the center is located at X=0, Y=0. The range of values are: -20.0
≤ X,Y ≤ 20.0. Player one‘s darts are represented by the first 3
pairs of values, and player two‘s by the last 3 pairs of values. Input is
terminated by the first value of a dataset being -100.

Output

For each dataset, print a line of the form:

SCORE: N to M, PLAYER P WINS.

Or:

SCORE: N to M, TIE.

N is player one‘s score, and M is player two‘s score. P is either 1 or 2 depending on which player wins. All values are non-negative integers.

Formula

Recall: r² = x² + y² where r is the radius, and (x, y) are the coordinates of a point on the circle.

Sample Input

-9 0 0 -4.5 -2 2 9 0 0 4.5 2 -2
-19.0 19.0 0 0 0 0 3 3 6 6 12 12
-100 0 0 0 0 0 0 0 0 0 0 0

Sample Output

SCORE: 240 to 240, TIE.
SCORE: 200 to 140, PLAYER 1 WINS.

Source: Greater New York
2004

源代码：

 1 #include <iostream>
 2 #include <string.h>
 3 const int maxn = 15;
 4 using namespace std;
 5
 6 double score[maxn];
 7
 8 int sCount (double i, double j)    {
 9     double temp = i*i + j*j;
10     if (temp <= 9)    return 100;
11     else if (temp <= 36 && temp > 9)    return 80;
12     else if (temp <= 81 && temp > 36)    return 60;
13     else if (temp <= 144 && temp > 81)    return 40;
14     else if (temp <= 225 && temp > 144)    return 20;
15     else return 0;
16 }
17 int main()
18 {
19     memset(score, 0, sizeof(score));
20     while (cin >> score[0] && score[0] != -100)    {
21         for (int i = 1; i < 12; i++)    {
22             cin >> score[i];
23         }
24         int result1 = 0, result2 = 0;
25         result1 += sCount(score[0], score[1]) + sCount(score[2], score[3])
26             + sCount(score[4], score[5]);
27         result2 += sCount(score[6], score[7]) + sCount(score[8], score[9])
28             + sCount(score[10],score[11]);
29         if (result1 > result2)    cout << "SCORE: "<<
30              result1 << " to " << result2 << ", PLAYER 1 WINS."<< endl;
31         else if (result2 > result1)    cout << "SCORE: "<<
32              result1 << " to " << result2 << ", PLAYER 2 WINS."<< endl;
33         else    cout << "SCORE: "<< result1 << " to " << result2 << ", TIE." << endl;
34     }
35     return 0;
36 }