Safest Buildings

PUBG is a multiplayer online battle royale video game. In the game, up to one hundred players parachute onto an island and scavenge for weapons and equipment to kill others while avoiding getting killed themselves. BaoBao is a big fan of the game, but this time he is having some trouble selecting the safest building.

There are buildings scattering on the island in the game, and we consider these buildings as points on a two-dimensional plane. At the beginning of each round, a circular safe area whose center is located at (0, 0) with radius will be spawned on the island. After some time, the safe area will shrink down towards a random circle with radius (). The whole new safe area is entirely contained in the original safe area (may be tangent to the original safe area), and the center of the new safe area is uniformly chosen within the original safe area.

The buildings covered by the new safe area is called the safe buildings. Given the radius of the safe areas and the positions of the buildings, BaoBao wants to find all the buildings with the largest probability to become safe buildings.

Input

There are multiple test cases. The first line of input contains an integer , indicating the number of test cases. For each test case:

The first line contains three integers (), and (), indicating the number of buildings and the radius of two safe circles.

The following lines each contains 2 integers and (), indicating the coordinate of the buildings. Here we assume that the center of the original safe circle is located at , and all the buildings are inside the original circle.

It's guaranteed that the sum of over all test cases will not exceed 5000.

Output

For each test case output two lines.

The first line contains an integer , indicating the number of buildings with the highest probability to become safe buildings.

The second line contains integers separated by a space in ascending order, indicating the indices of safest buildings.

Please, DO NOT output extra spaces at the end of each line.

Sample Input

2
3 10 5
3 4
3 5
3 6
3 10 4
-7 -6
4 5
5 4

Sample Output

1
1
2
2 3

題目連結：

https://vjudge.net/problem/ZOJ-3993

題意描述：

給你n個座標兩個圓，半徑分別為R和r，然後問在半徑為r圓內概率最大的點，並輸出點的個數和這些點是第幾個點。

解題思路：

用一個結構體存這些點和它們到原點的距離，然後判斷最小點點到原點的距離和R-2*r的大小，如果t小於R-2*r就把小於等於R-2*r的點全部輸出，否則只輸出離原點最近的點即可。

程式程式碼：

#include<stdio.h>
#include<algorithm>
using namespace std;
#define inf 99999999
struct data{
	int x;
	int y;
	int d;
	int flag;
}a[110];
int main()
{
	int T,i,j,n,R,r,t,temp,count;
	scanf("%d",&T);
	while(T--)
	{
		t=inf;
		count=0;
		scanf("%d%d%d",&n,&R,&r);
		for(i=1;i<=n;i++)
		{
			scanf("%d%d",&a[i].x,&a[i].y);
			a[i].d=a[i].x*a[i].x+a[i].y*a[i].y;
			t=min(t,a[i].d);
		}
		temp=(R-2*r)*(R-2*r);
		if(t<=temp)
		{
			for(i=1;i<=n;i++)
				if(a[i].d<=temp)
					a[count++].flag=i;
		}	
		else
		{
			for(i=1;i<=n;i++)
				if(a[i].d==t)
					a[count++].flag=i;
		}
		printf("%d\n",count);
		for(i=0;i<count;i++)
		{
			printf("%d",a[i].flag);
			if(i==count-1)
				printf("\n");
			else
				printf(" ");
		}
	}
	return 0;
}