准备资料(国外英语资料).docVIP

准备资料(国外英语资料) 11, the common denominator, LCM Syntax: resulet=hcf (int, a, int, b), result=lcd (int, a, int, b) Parameter: A: Int a, for the common denominator or LCM B: Int b, for the common denominator or LCM Return value: Returns the maximum common divisor (HCF) or LCM (LCD) Be careful： LCD needs to be used with HCF Source program: Int HCF (int, a, int, b) { Int r=0; While (B, =0) { R=a%b; A=b; B=r; } Return (a); } LCD (int, u, int, V, int, H) { Return (u*v/h); } .22 two-point distance (2D, 3D) Syntax: result=distance_2d (float, x1, float, X2, float, Y1, float, Y2); Parameter: X/y/z1 to 2: The X, y, and Z coordinates of each point Return value: Distance between two points Be careful： Need math.h Source program: Float, distance_2d (float, x1, float, X2, float, Y1, float, Y2) { Return (sqrt (), * (x1-x2) + (y1-y2) * (y1-y2)) (x1-x2); } Float, distance_3d (float, x1, float, X2, float, Y1, float, Y2, float, Z1, float, Z2) { Return (x1-x2 (), * (x1-x2) + (y1-y2) * (y1-y2) + (z1-z2) * (sqrt) * (z1-z2)); } The 33 judgment point is on the line segment Syntax: result=Pointonline (Point, P1, Point, P2, Point, P); Parameter: P1, p2: The two endpoint of a line segment P: Be judged Return value: 0: the point is not on the line; 1: point on the line segment Be careful： Returns 1 on the P line endpoint Need math.h Source program: #define MIN (x, y) (x y = x: y) #define, MAX (x, y) (x y, X: y) Typedef struct { Double, x, y; } Point; Int FC (double, x1, double, x2) { If (x1-x20.000002x1-x2-0.000002) return 1; else return 0; } Int Pointonline (Point, P1, Point, P2, Point, P) { Double, x1, Y1, X2, y2; X1=p.x-p1.x; X2=p2.x-p1.x; Y1=p.y-p1.y; Y2=p2.y-p1.y; If (FC (x1*y2-x2*y1,0) ==0) return 0; If ((MIN (p1.x, p2.x) =p.xp.x=MAX (p1.x, p2.x)) and (MIN (p1.y, p2.y) =p.yp.y=MAX (p1.y, p2.y)) Return 1; else return 0; } 44, judge whether the two lines intersect Syntax: result=sectintersect (Point, P1, Point, P2, Point, P3, Point, P4); Parameter: P1 to 4: The four endpoint of two line segm