PointA

凸多边形定点逆时针排序

includeusingnamespacestd;#definemaxn20000inttop=2;structPoint{  doublex,y,len;}Pt[maxn],Stack[maxn],Point_A;doubleCross(Pointa
u013570474·2014-08-09 23:00

POJ1328

includeusingnamespacestd;structpoint{  doublex,y;}stl[1005];structnode{  doublex1,x2;}cir[1005];intcmp(pointa
u013570474·2014-07-13 16:00

chapter4

doubledist(structa,structb) { returnhypot(a.x-b.x,a.y-b.y); } typedefstruct{doublex,y}Point; doubledist(Pointa
xtzmm1215·2014-06-27 16:00

NEFU 652 叉积

(cross==0) ABC共线if（cross #include #include usingnamespacestd; structpoint { intx,y; }p[3]; intcross(pointA
u013790563·2014-05-05 13:00

ZOJ1081 Points Within

include usingnamespacestd; structpoint{ intx,y; point(doublex=0,doubley=0):x(x),y(y){} }; pointoperator-(pointA
wangwenhao00·2014-04-29 21:00

HDU 1115 Lifting the Stone

usingnamespacestd; structpoint{ doublex,y; point(doublex=0,doubley=0):x(x),y(y){} }; pointoperator-(pointA
wangwenhao00·2014-04-27 20:00

POJ 2653 线段相交判断 （叉积）

boolans[N]; //定义点 structPoint { doublex,y; Point(doublex=0,doubley=0):x(x),y(y){} }; structsegment { Pointa
fjy4328286·2014-03-26 09:00

python实现k均值算法示例(k均值聚类算法)

:importpylabaspl#calcEuclidsquiredefcalc_e_squire(a,b):return(a[0]-b[0])**2+(a[1]-b[1])**2#initthe20pointa
·2014-03-16 10:24

向量相加

private: intX; intY; public: Point(); Point(intx,inty); Point&operator=(Point&A); Pointoperator+(PointA
u013491262·2014-03-08 16:00

hdu 1086线段相交模板

#include"cstdio" #include"cmath" #include"algorithm" usingnamespacestd; structpoint { doublex,y; }; pointa
洛伊佩拉·2013-12-12 19:00

hdu 2108

include #include"math.h" usingnamespacestd; constdoubleeps=1e-10; structpoint{intx,y;}; intcrossProduct(pointa
洛伊佩拉·2013-12-09 18:00

hdu 1007

usingnamespacestd; constintMAXN=100100; structPoint { doublex,y; }; Pointpoint[MAXN]; Points[MAXN]; intcmp(Pointa
Hearthougan·2013-12-06 10:00

JAVA求两直线交点和三角形内外心的方法

一.求两直线交点复制代码代码如下:classPoint{doublex;doubley;publicPoint(){this.x=0;this.y=0;}}classLine{Pointa;Pointb
·2013-11-14 12:01

movetowds 写法

publicvarTarget:Vector3; functionAwake(){ Target=PointA.transform.position; } functionStart(){ }
luyuncsd123·2013-11-07 22:00

[互联网面试笔试汇总C/C++-22] 拷贝构造函数调用的时机-完美世界

进行形参和实参结合时C：如果函数的返回值是类的对象,函数执行完成返回调用者时D：用类的一个对象给另一个对象赋值的时答案：D分析：A：当用类的一个对象初始化该类的另一个对象时.例如:intmain() { pointA
shishengshi·2013-10-24 15:00

poj 2187 Beauty Contest

include usingnamespacestd; typedefstructpnode { intx,y,d; }point; pointP[50005]; //两点间距离 intdist(pointa
mobius_strip·2013-10-09 03:00

hdu 4741 Save Labman No.004 [2013年杭州ACM网络赛]

{ doublex,y,z; point(doublexx=0,doubleyy=0,doublezz=0):x(xx),y(yy),z(zz){} }vector; vectoroperator-(pointa
u010679062·2013-09-15 19:00

hdu4720 三角形的最小圆覆盖

求一个三角形的最小圆覆盖两种情况：1.是锐角及直角三角形，那么这个圆就是外接圆2.是钝角三角形，那么这个圆的直径是这个最长边的中点doublegetDis(Pointa,Pointb) { returnsqrt
ygqwan·2013-09-11 19:00

c++求两个线段的交点

includeusingnamespacestd;structpoint{   doublex;   doubley;};structsegment{pointstart;pointend;};doublemulti(pointa
侯禹·2013-09-05 13:00

c++求两个向量的交点

POINTp1,POINTp2,POINTp0){   return(p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);}POINTintersection(POINTa
侯禹·2013-09-05 13:00

C++中给static变量赋值和返回

classPointA{ public: voidshow() { std::cout<<"PointA"<
qqMCY·2013-08-19 19:00

ZOJ:3716 Ribbon Gymnastics

include #include #include usingnamespacestd; structPoint{ doublex; doubley; }p[5]; doubledist(Pointa
kkkwjx·2013-08-19 18:00

UVA 10556 Biometrics

include usingnamespacestd; structpoint { intx,y; point(intx=0,inty=0):x(x),y(y){} }; pointoperator-(pointa
lfj200411·2013-08-08 20:00

poj2007

#include #include usingnamespacestd; #defineeps1e-8 structpoint { doublex,y; }s; doublegetangle(pointa
zhengnanlee·2013-08-03 20:00

poj1673

#include #include #include structpoint{doublex,y;}; structline{pointa,b;}; doubledistance(pointp1,pointp2
zhengnanlee·2013-08-01 14:00

竞赛快速及常用（后续更新）

根据素数的倍数都是非素数进行筛选）inta[1000000]={1,1,0}; voidis_prime() { intI,J,n; for(I=2;I structpoint { doublex; doubley; }; pointA
y990041769·2013-07-25 08:00

【模板】线段相交

#include #include #include #include usingnamespacestd; structpoint { doublex,y; }; pointa[
libin56842·2013-07-18 09:00

凸包求面积，周长

{ doublex; doubley; }point; pointpoints[N];//点集 pointchs[N];//栈 intsp;//栈顶指针 //计算两点之间距离 doubledis(pointa
kisstears·2013-07-15 10:00

UVALive 4992

include #include #include usingnamespacestd; structpoint{ doublex,y; }p[50010],s[100010]; structline{ pointa
zzxyyx_1·2013-06-19 22:00

hdu 1115 Lifting the Stone （求重心）

{ doublex,y; point(doublex=0.0,doubley=0.0):x(x),y(y){} }vector; pointp[1000010],c; vectoroperator-(pointa
u010679062·2013-06-11 18:00

项目4

include usingnamespacestd; classPoint{ public: Point(doublex=0,doubley=0):x(x),y(y){} doubledistance(Pointa
pingzongyuying·2013-05-18 08:00

HDU3400(计算几何中的三分法利用)

#include #include #include usingnamespacestd; typedefstruct { doublex,y; }point; pointa,b
ACdreamers·2013-05-16 11:00

最小圆覆盖

include structPoint { doublex,y; }p[101],o;//定义点和圆心 intn; doubler;//圆半径 doubleeps=1e-6; doubledist(Pointa
dapengking·2013-04-20 23:00

POJ1269(判断线段相交)

//直线AB与直线CD的关系，如果相交就输出交点坐标 voidSolve(PointA,PointB,PointC,PointD) { if(fabs(cro
ACdreamers·2013-04-16 21:00

POJ1265(Pick定理的应用)

而对于线段上的整点数我们可以通过以下计算得到：intSegmentPointNum(PointA,PointB){returngcd(abs(A.x-B.x),abs(A.y-B.y));}然后我们把所有线段的整点数加起来就是多边形边
ACdreamers·2013-04-14 20:14

POJ1265(Pick定理的应用)

而对于线段上的整点数我们可以通过以下计算得到：intSegmentPointNum(PointA,PointB) { returngcd(abs(A.x-B.x),abs(A.y-B.y)); }
ACdreamers·2013-04-14 20:00

hdu 2436

include 3#include 4 5usingnamespacestd; 6 7typedefstructpoint 8{ 9doublex,y,z; 10}point; 11 12pointa
·2013-04-10 08:00

判断两条线是否相交

线段1终点坐标c线段2起点坐标d线段2终点坐标intersection相交点坐标 *reutrn是否相交:0:两线平行-1:不平行且未相交1:两线相交 */ publicintsegIntersect(PointA
聚焦前沿技术·2013-03-26 17:00

POJ 1106 Transmitters

usingnamespacestd; #definehPI1.5707963267949 #defineeps1e-8 structpoint { doublex; doubley; }; doublecross(pointa
sssogs·2013-03-02 23:00

CF 第18场 简单题目一览表

usingnamespacestd; intwx[4]={-1,0,1,0}; intwy[4]={0,-1,0,1}; structpoint{ intx,y; }; pointP[3]; intdist2(pointA
azheng51714·2013-01-21 20:00

hdu1558并查集+线段相交

include #include usingnamespacestd; intpre[1010],sum[1010]; structpoint{ doublex,y; }; structEDGE{ pointa
dellaserss·2012-12-03 11:00

C++中的虚继承

在这里有四个类：Point,PointA,PointB,DerivedPoint。
zhy_cheng·2012-11-25 22:00

HDU 1086 计算几何 求线段交点（吉大模板）

a:b;} boolinter(pointa,pointb,pointc,pointd){ if(min(a.x,b.x)>
vsooda·2012-09-24 19:00

计算三角形面积（叉积）

include#include#includeusingnamespacestd;typedefstructpoint{  doublex;  doubley;}point;doubleCrossProduct(pointA
wangwenhao00·2012-09-17 22:00

poj1556 The Doors

#include #include structpoint { doublex,y; }p[200]; structsegment { pointa,b; }s[200]; doubleg[200][200
rookie_Algo·2012-08-25 14:00

JS 判断直线相交

functionCheckLineCrossByPoint(LineA_PointA,LineA_PointB,LineB_PointA,LineB_PointB)   {      varv1=0,v2
goodnew·2012-08-23 13:00

【计算几何】poj1113 Wall

include usingnamespacestd; structPoint{ intx,y; }; intcmp(constvoid*elem1,constvoid*elem2); voidadd(Pointa
lwfcgz·2012-08-16 13:00

poj2318

判断在线段左边还是右边，找到之后进行统计即可 #include #include #include usingnamespacestd; structPoint{ intx,y; }; structLine{ Pointa
Non_Cease·2012-07-17 10:00

uva10034Freckles - prime最小生成树

十几次--各种debug诶   #include #include #defineINF1000000000 structpoint { doublex,y; }P[105]; doubleD(pointa
dellaserss·2012-07-16 21:00

计算几何之判断线段相交

给定两个点:typedef struct{ double x,y;}Point;PointA1,A2,B1,B2;首先引入两个实验：a.快速排斥实验设以线段A1A2和线段B1B2为对角线的矩形为M,N;
chenbang110·2012-07-13 07:00
上一页 1 2 3 4 5 6 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他