Table tennis

Table tennis

(Input File: table.in / Standard Output)

The 49th World Table Tennis Championships was held in Guangzhou from February 24th to March 2nd. It was a chance not to be missed for the table tennis enthusiast. TZD and other table tennis enthusiast in Zhongshan University decided to watch the first day’s matches. That day when they got to the gymnasium, there was still an hour left. So they decided to walk around. They found that not far away there were some children playing games round a table. This game was played like this: you stand by the table on one side, and on the other side there is a machine to serve you the balls one by one. Then you hit

the balls. See figure 2.9.1.

Figure 2.9.1 table tennis
On the half of the table opposite to you, there are three circles of different size. From left to right, see figure 2.9.2, we call them big circle, middle circle and small circle. If you hit the ball onto the area inside the big circle, you will get one point. For the middle circle you will get two points. And for the small circle three points. But if you hit the ball right onto the boundary of circles, you will not get any points. If you get enough points, you will be given a small gift! TZD also wanted to have a try.

Figure 2.9.2 the three circles
We assume that the circles are given by three integer (x- coordinate of the centre, y- coordinate of the centre, radius). From left to right the three circles are（30, 30, 20）,（100, 30, 10）,（170, 30, 5）. And each hit is described by two integer (xpos, ypos), meaning that
TZD hit the ball onto the position (xpos, ypos). Now please tell TZD how many points he got after N hits.

Input:

The first line contains a positive integer T. T is the number of test cases followed.
For each test case, there is a positive integer N (0<=N<=60) in the first line, the number of TZD’s hits. Next come N pairs of integer (xpos, ypos), each pair in one line.(0<=xpos<=200, 0<=ypos<=100).

Output:

For each test case, print the total points in one line.

Sample input:

3
2
30 31
100 32
1
30 50
3
30 30
99 30
170 30

Sample output:

3
0
6

水题一道，但是英语不好，害到WA了两次。。。
AC代码：

#include <iostream>
#include <cstring>
using namespace std;
int fun(long long x,long long y)
{
    if(x*x+y*y-60*(x+y)+1400<0)
        return 1;
    else if(x*x+y*y-200*x-60*y+10800<0)
        return 2;
    else if(x*x+y*y-340*x-60*y+29775<0)
        return 3;
    return 0;
}
int main()
{
    int n,m,i;
    long long j,k;
    int cnt;
    cin >> n;
    while (n--)
    {
        cnt=0;
        cin >> m;
        for (i=0;i<m;++i)
        {
            cin >> j >> k;
            cnt+=fun(j,k);
        }
        cout << cnt << endl;
    }
    return 0;
}