There is a curious man called Matt.

One day, Matt‘s best friend Ted is wandering on the non-negative half of the number line. Matt finds it interesting to know the maximal speed Ted may reach. In order to do so, Matt takes records of Ted’s position. Now Matt has a great deal of records. Please help him to find out the maximal speed Ted may reach, assuming Ted moves with a constant speed between two consecutive records.

The first line contains only one integer T, which indicates the number of test cases.

For each test case, the first line contains an integer N (2 ≤ N ≤ 10000),indicating the number of records.

Each of the following N lines contains two integers t_i and x_i (0 ≤ t_i, x_i ≤ 10⁶), indicating the time when this record is taken and Ted’s corresponding position. Note that records may be unsorted by time. It’s guaranteed that all t_i would be distinct.

For each test case, output a single line “Case #x: y”, where x is the case number (starting from 1), and y is the maximal speed Ted may reach. The result should be rounded to two decimal places.

2
3
2 2
1 1
3 4
3
0 3
1 5
2 0

Case #1: 2.00
Case #2: 5.00

Hint
In the ?rst sample, Ted moves from 2 to 4 in 1 time unit. The speed 2/1 is maximal.
In the second sample, Ted moves from 5 to 0 in 1 time unit. The speed 5/1 is maximal.
 

liuyiding | We have carefully selected several similar problems for you: 5338 5337 5336 5335 5334

#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
struct nod{
	double tim,opt;
}a[10010];
int cmp(nod a,nod b) {
	return a.tim<b.tim;
}
int main(){
	int t,n,i,j,cas=0;
	scanf("%d",&t);
	while(t--){
		cas++;
		scanf("%d",&n);
		for(i=0;i<n;++i){
			scanf("%lf%lf",&a[i].tim,&a[i].opt);
		}
		sort(a,a+n,cmp);
		double maxn=0,u;	
		for(i=1;i<n;++i){
			maxn = max(maxn,fabs((a[i].opt-a[i-1].opt)/(a[i].tim-a[i-1].tim))) ;
		}
		printf("Case #%d: %.2lf\n",cas,maxn);
	}
	return 0;
}