Codeforces Round #444 (Div. 2), problem: (E) Little Brother Solution In C/C++

By | 2017-11-07T20:08:13+00:00 November 7th, 2017|Categories: C/C++, Programming|Tags: , , , , , , , |

#include<iostream> #include<cstdio> #include<cstring> #include<string> #include<cmath> #include<algorithm> #include<cstdlib> #define eps 1e-7 using namespace std; double x[100010],y[100010],r[100010],L; struct node{double l,r;}a[100010]; struct P{double x,y;}A,B,M,s,O,p[100010]; int n; inline double dis(P a,P b){return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));} inline P operator-(P a,P b){return (P){a.x-b.x,a.y-b.y};} inline double operator*(P a,P b){return a.x*b.y-a.y*b.x;} inline bool cmp(node [...]