Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on the coasting, can only cover d distance, so an island in the sea can be covered by a radius installation, if the distance between them is at most d.
We use Cartesian coordinate system, defining the coasting is the x-axis. The sea side is above x-axis, and the land side below. Given the position of each island in the sea, and given the distance of the coverage of the radar installation, your task is to write a program to find the minimal number of radar installations to cover all the islands. Note that the position of an island is represented by its x-y coordinates.
Input
The input consists of several test cases. The first line of each case contains two integers n (1 n 1000) and d, where n is the number of islands in the sea and d is the distance of coverage of the radar installation. This is followed by n lines each containing two integers representing the coordinate of the position of each island. Then a blank line follows to separate the cases.
The input is terminated by a line containing pair of zeros.
Output
For each test case output one line consisting of the test case number followed by the minimal number of radar installations needed. "-1" installation means no solution for that case.
Sample Input
3 2
1 2
-3 1
2 1
1 2
0 2
0 0
Sample Output
Case 1: 2
Case 2: 1
Source: Asia 2002, Beijing (Mainland China)
-5 3
-3 5
2 3
3 3
/****************************************/
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <string>
#include <iostream>
using namespace std;
/****************************************/
struct Node
{
double left, right;
}a[1010];
bool cmp(Node a, Node b)
{
if(a.right != b.right)
return a.right < b.right;
return a.left < b. left;
}
int main()
{
int n, d, cas = 1;
//freopen("rader.in", "r", stdin);
while(~scanf("%d%d", &n, &d), n||d) {
int maxi = -1, x, y;
for(int i = 0; i < n; i++) {
scanf("%d%d", &x, &y);
a[i].left = x - sqrt((double)d*d - y*y);
a[i].right = x + sqrt((double)d*d - y*y);
maxi = max(maxi, y);
}
printf("Case %d: ", cas++);
if(maxi > d) {
printf("-1\n");
}
else {
sort(a, a+n, cmp);
int ans = 1;
for(int i = 0, j = 1; j < n; j++) {
if(a[j].left > a[i].right) {
ans++;
i = j;
}
}
printf("%d\n", ans);
}
}
return 0;
}