↓ Skip to main content
111qqz’s blog
  1. Posts/

poj 2074 Line of Sight (计算几何，细节题)

ACM 算法竞赛
Note: This article is available in Chinese only. 本文暂无英文版本。 View original

Related

hdu 1086 A - You can Solve a Geometry Problem too （线段的规范相交&&非规范相交）

·2 mins
ACM 算法竞赛
A - You can Solve a Geometry Problem too **Time Limit:**1000MS **Memory Limit:**32768KB 64bit IO Format:%I64d & %I64u Submit Status Description Many geometry（几何）problems were designed in the ACM/ICPC. And now, I also prepare a geometry problem for this final exam. According to the experience of many ACMers, geometry problems are always much trouble, but this problem is very easy, after all we are now attending an exam, not a contest :) Give you N (1<=N<=100) segments（线段）, please output the number of all intersections（交点）. You should count repeatedly if M (M>2) segments intersect at the same point.