hdu 2073

找公式。

#include <iostream>
#include <cmath>
#define s sqrt(2.0)
using namespace std;

double dis(int x, int y)
{
	double d = 0;
	int a = x + y;
	d += a * (a-1) * s / 2;
	for (int i=a;i>0;--i)
	d += sqrt(i*i + (i-1)*(i-1));
	d += x * s;
	return d;
}
int main()
{
	int n, x1, x2, y1, y2;
	scanf("%d", &n);
	while (n--)
	{
		scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
		double d = 0;
		d = dis(x1,y1) - dis(x2,y2);
		printf("%.3f\n", fabs(d));
	}
	return 0;
}