PointA

uva 12818 Arc and Point

includeusingnamespacestd;structpoint{doublex,y;point(){}point(double_x,double_y){x=_x;y=_y;}}a,b,c,p;pointwx(pointa
dd_lucky·2016-03-30 21:00

UVA 10382(p79)----Watering Grass

constintmaxn=1e4+50; structpoint { doublel,r; booloperatorr; elsereturnrhs.l>l; } }; intn,l,w,num; pointa
wang2147483647·2016-03-23 22:00

LA 4254(p80)----Processor

usingnamespacestd; constintINF=1e7; constintmaxn=1e4+50; structpoint { intl,r,w; booloperatorrhs.r; } }; intn; pointa
wang2147483647·2016-03-23 21:00

HDU 5128

usingnamespacestd; structPoint{ intx,y; Point(intx=-1,inty=-1):x(x),y(y){} }; #defineVectorPoint structLine { Pointa
u013889450·2016-03-22 18:00

hdu 4571 Travel in time(floyd+dp)

搜索答案#include #include #include usingnamespacestd; typedefstruct { intc,s,num; }Point; intg[105][105]; Pointa
a709743744·2016-03-21 23:00

重写比较

*##建议重写equals方法实现对象是否相等比较*@authorHeying**/ publicstaticvoidmain(String[]args){ Pointa=newPoint(1,2)
u011249702·2016-03-14 15:00

UVA 11134(p237)----Fabled Rooks

include #definedebu usingnamespacestd; constintmaxn=5*1e3+50; structpoint { intl,r,id; }; intn,v[maxn]; pointa
wang2147483647·2016-03-10 21:00

C++结构到类的演变

voidsetxy(doublea,doubleb) { x=a;y=b; } voiddisplay(){ cout<pointa
知_行·2016-03-07 23:00

POJ 3070 Fibonacci（矩阵快速幂）

#include usingnamespacestd; constintMOD=10000; structpoint { intm[2][2]; }ans,base; pointmulti(pointa
qq_32473657·2016-03-07 21:00

LA 3135(p188)----Argus

charst[10]; structpoint { intid,t; point(inta=0,intb=0):id(a),t(b){} }; pointb[maxn]; vectora; intcmp(pointa
wang2147483647·2016-03-02 17:00

UVA 11729(p2)----Commando War

#include usingnamespacestd; constintmaxn=1010; structpoint { intb,j; }; intn,cas=0; pointa[maxn]; intcmp
wang2147483647·2016-02-28 19:00

UVA 10881(p9)----Piotr's Ants

#include usingnamespacestd; constintmaxn=1e4+50; structpoint { intid,p,d; }; intpos[maxn]; pointa[maxn
wang2147483647·2016-02-28 19:00

HDU2036三角形面积求法

typedefstructpoint { intx,y; }point; pointa[110];//n的范围限制 doublearea(pointp,pointq) { returnp.x*q.y-q.x
zjy2015302395·2016-02-26 17:00

UVA 437(p269)----The Tower of Babylon

structpoint { intx,y,z; point(inta=0,intb=0,intc=0):x(a),y(b),z(c){} }; vectorg; intn,f[1000]; intcmp(pointa
wang2147483647·2016-02-25 22:00

UVA 230(p136)----Borrowers

include #include #definedebu usingnamespacestd; structpoint { stringbk,wr; }; vectorlt; mapname; intcmp(pointa
wang2147483647·2016-02-25 22:00

c++ 程序

usingnamespacestd; intresult(int,int); constintk=2; structpoint{ intx,y; }; intmain() { intz(0),b(50); pointa
知_行·2016-02-21 15:00

BZOJ1132: [POI2008]Tro

; #defineyouhua__attribute__((optimize("O2"))) structPoint { intx,y; youhuainlinefriendintoperator*(Pointa
liutian429073576·2016-02-16 11:00

C++面向对象

Pointa(1,2); //两种写法都会调用复制构造函数，只是写法上不同。 Pointb(a);//用对象a初始化b Pointc=a;///
Sinte-Beuve·2016-02-02 19:33

【SDOI2014】【BZOJ3533】向量集

include #include #defineMAXN400010 #defineGET(ch>='0'&&chb.y:a.x>1;build(lchild);build(rchild); } LLDir(Pointa
CreationAugust·2016-01-09 14:00

半平面求交——点在凸包外

usingnamespacestd; constintmaxn=50010; constdoubleEPS=1e-8; structPoint { doublex,y; }; Pointp[maxn]; structLine { Pointa
Tczxw·2015-11-21 11:00

半平面求交——放置守卫

constintmaxn=1510; constdoubleEPS=1E-12; structPoint { doublex,y; }; Pointconvex[maxn]; structLine { Pointa
Tczxw·2015-11-21 10:00

bzoj-1941 Hide and Seek

不算自己)的最小值；n #include #include #defineN500100 usingnamespacestd; structPoint { intx[2]; friendintdis(Pointa
ww140142·2015-11-20 22:00

圈奶牛<计算几何>

include usingnamespacestd; structpoint{//x横坐标,y纵坐标. doublex; doubley; }p[10000],chosen[10000]; boolcmp(pointa
YoDReAMfY·2015-11-18 20:00

HDU 1756 (计算几何 点在多边形内)

; #definemaxn111 structpoint{ doublex,y; point(double_x=0,double_y=0):x(_x),y(_y){} pointoperator-(pointa
morejarphone·2015-11-10 17:00

poj1269

using namespace std; struct Point { double x,y; }; class Line { public: Point pointa
·2015-11-02 10:30

hdoj 4347 KD树

#defineclr(s,t)memset(s,t,sizeof(s)); #defineN50005 #defineQ10005 intk,n,m,T,idx,son[Nq; doubledist(pointa
dumeichen·2015-10-24 12:00

C++面向对象

Pointa(1,2);//两种写法都会调用复制构造函数，只是写法上不同。Pointb(a);//用对象a初始化bPointc=a;////用对
Fururur·2015-09-12 20:00

计算几何常用的函数/方法

(一)求多边形的面积（用叉积计算）代码如下：//叉积,可以用来判断方向和求面积 doublecross(Pointa,Pointb,Pointc){ return(c.x-a.x)*(b.y-a.y)-
u013790563·2015-09-02 15:00

zoj 2870 Segments 线段与直线相交

#include usingnamespacestd; constdoubleeps=1e-8; structpoint { doublex,y; }a[1024]; doublecross(pointa
xinag578·2015-09-02 15:00

poj 1113 Wall Andrew

include #include #include usingnamespacestd; structPoint { intx,y; }p[1024],ch[1024]; Pointoperator-(Pointa
xinag578·2015-08-29 11:00

USACO Ordered Fractions(枚举)

include#defineMAX170#defineLLlonglongusingnamespacestd;structpoint{intx,y;doublevalue;friendbooloperator<(pointa
EaShion1994·2015-08-27 17:16

UVALive 6655 Two Points Revisited

#include #include #include usingnamespacestd; structPoint{ intx,y; }; intmain(){ ints,n,tt=1; Pointa1
firenet1·2015-08-25 18:00

POJ 1106 Transmitters

#include #include structpoint { intx,y; }; pointv[150],p; doubleDis(pointa,pointb) { retu
ZengAMing·2015-08-13 19:00

C++_重载运算符<< ostream流重载注意事项_使自定义数据可以用cout输出

usingnamespacestd; structPoint{ intx; inty; }; ostream&operatorPointList; vector::iteratoriter; //a[10]=5; Pointa
u010003835·2015-08-11 15:00

集合DP 点集匹配问题

defineINF0x3f3f3f3f #defineN21 structpoint { doublex,y,z; }P[N]; doublex[N],y[N]; doubled[1<pointa
DoJintian·2015-08-05 19:00

求相交圆面积

definePiacos(-1.0) usingnamespacestd; constdoubleeps=1e-8; structpoint{ doublex,y; }; doubledist(pointa
ydd97·2015-08-03 11:00

计算几何：线段判交模板--ACM

线段判交--ACM给定两个点:typedef struct{ double x,y;}Point;PointA1,A2,B1,B2;首先引入两个实验：a.快速排斥实验设以线段A1A2和线段B1B2为对角线的矩形为
Enjoying_Science·2015-07-04 17:00

POJ 1113 && HDU 1348 Wall（凸包）

l（n,l #include #include typedefstruct { doublex;//横坐标 doubley;//纵坐标 doublek;//与第一个定点连线的正切值 }point; pointa
V5ZSQ·2015-06-20 16:00

凸包

structPoint{ doublex,y; }; structKing{ Pointb[maxn]; doublearea; intmark; intlenk; }; boolcompare(Pointa1
u013097262·2015-06-18 09:00

hdu 1558 Segment set（并查集+判断线段是否相交）

usingnamespacestd; intfather[1005]; intson_cnt[1005]; chars[5]; //intcnt; structpoint { doublex,y; }; pointa
xky1306102chenhong·2015-06-10 22:00

ostream& operator << (ostream& os, Point& pt)

在网上找到了答案如下：如果写成这样ostreamoperator<<(ostream&os,Point&pt) 则：Pointa,b;cout<
xiaohaijiejie·2015-05-28 13:00

UVA 11796 Dog Distance

doubleMin,Max;structPoint{  doublex,y;  Point(){}  Point(doublex,doubley):x(x),y(y){}};Pointoperator+(PointA
Misdom_Tian_Ya·2015-04-25 21:00

opengl:凸包算法

准备工作判断点在有向线段的左侧可以通过叉积判断，如下为k在有向线段ab的左侧代码描述：doublemultiply(Pointa,Pointb,Pointk) { doublex1=b.x-a.x; doubley1
majing19921103·2015-04-15 00:00

js 百度地图 获取两点的直线距离

Latitude); //创建点坐标AvarpointB=newBMap.Point( Longitude,Latitude ); //创建点坐标Balert('两点的距离是：'+(map.getDistance(pointA
jack088·2015-04-02 16:00

形象地聊聊C++中的浅拷贝与深拷贝

usingnamespacestd; classPoint { public: intx; inty; Point(intxx,intyy) { x=xx; y=yy; } }; intmain() { PointA
stpeace·2014-11-08 00:00

【NOIP2002】矩形覆盖 DFS

#include #include #defineN55 #defineinf0x3f3f3f3f usingnamespacestd; structPoint{intx,y;}; intcmpx(Pointa
Vmurder·2014-10-24 08:00

HDU2036 改革春风吹满地

include#defineMAX1000usingnamespacestd;typedefstructA{  doublex,y;}POINT;POINTp[MAX];doublemul_cross(POINTa
AC_Gibson·2014-10-15 13:00

二维几何基础模板(二)

Vectorw){ Vectoru=P-Q; doublet=Cross(w,u)/Cross(v,w); returnP+v*t; }二、点到直线的距离doubleDistanceToLine(PointP,PointA
piaocoder·2014-09-28 16:00

判断两条线段是否相交

给定两个点:typedef struct{ double x,y;}Point;PointA1,A2,B1,B2;首先引入两个实验：a.快速排斥实验设以线段A1A2和线段B1B2为对角线的矩形为M,N;
u014665013·2014-09-21 13:00

Point

PointA way of conceptualizing price changes in the trading of securities. 
pczhangtl·2014-08-21 17:00
上一页 1 2 3 4 5 6 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他