题目地址:poj3675
这个题和上一题是一样的。
关于求直线和圆的交点呢,可以解方程,也可以用先求出投影点,然后按照单位向量方向移动sqrt(R*R-d*d) 这么长。
先还是g++ wa,c++ ac,但是这个时候%.2lf 已经改成%.2f了
最后,干脆把所有long double 全部改成了double 这样就过了。
额,有时候double 精度又不够,wa了以后double 改成long double就过了....真是
ps,有时候想一想,是不是算得太精确也不行呢,和标程算出的结果产生误差了。
代码:
#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<vector>
const double eps=1e-10;
const double PI=acos(-1.0);
using namespace std;
struct Point{
double x;
double y;
Point(double x=0,double y=0):x(x),y(y){}
void operator<<(Point &A) {cout<<A.x<<' '<<A.y<<endl;}
};
int dcmp(double x) {return (x>eps)-(x<-eps); }
int sgn(double x) {return (x>eps)-(x<-eps); }
typedef Point Vector;
Vector operator +(Vector A,Vector B) { return Vector(A.x+B.x,A.y+B.y);}
Vector operator -(Vector A,Vector B) { return Vector(A.x-B.x,A.y-B.y); }
Vector operator *(Vector A,double p) { return Vector(A.x*p,A.y*p); }
Vector operator /(Vector A,double p) {return Vector(A.x/p,A.y/p);}
ostream &operator<<(ostream & out,Point & P) { out<<P.x<<' '<<P.y<<endl; return out;}
//
bool operator< (const Point &A,const Point &B) { return dcmp(A.x-B.x)<0||(dcmp(A.x-B.x)==0&&dcmp(A.y-B.y)<0); }
bool operator== ( const Point &A,const Point &B) { return dcmp(A.x-B.x)==0&&dcmp(A.y-B.y)==0;}
double Dot(Vector A,Vector B) {return A.x*B.x+A.y*B.y;}
double Cross(Vector A,Vector B) {return A.x*B.y-B.x*A.y; }
double Length(Vector A) { return sqrt(Dot(A, A));}
double Angle(Vector A,Vector B) {return acos(Dot(A,B)/Length(A)/Length(B));}
double Area2(Point A,Point B,Point C ) {return