BZOJ 1094 ZJOI2007 粒子运动 计算几何

题目大意：给定一个圆，一堆粒子在里面反射，每个粒子只能撞墙k次，求全程粒子间距离的最小值

每两个粒子之间计算一遍

反射就是把射线沿着切线作镜像变换

随便搞搞咯……

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <algorithm>
#define M 110
#define EPS 1e-7
#define INF 1e9
using namespace std;
typedef long double ld;
struct Point{
	ld x,y;
	Point() {}
	Point(ld _,ld __):
		x(_),y(__) {}
	friend istream& operator >> (istream &_,Point &p)
	{
		_>>p.x>>p.y;
		return _;
	}
	friend Point operator + (const Point &p1,const Point &p2)
	{
		return Point(p1.x+p2.x,p1.y+p2.y);
	}
	friend Point operator - (const Point &p1,const Point &p2)
	{
		return Point(p1.x-p2.x,p1.y-p2.y);
	}
	friend ld operator * (const Point &p1,const Point &p2)
	{
		return p1.x*p2.y-p1.y*p2.x;
	}
	friend Point operator * (const Point &p,ld rate)
	{