蒻菜_羊羊羊的专栏

Morley’s Theorem Input: Standard Input Output: Standard Output  Morley’s theorem states that that the lines trisecting the angles of an arbitrary plane triangle meet at the vertices of an equilat

两圆相交。假定圆心分别为C1和C2,半径为r1和r2,圆心距为d，根据余弦定理可以算出C1C2到C1P1的角da,根据向量C1C2的极角a,加减da就可以得到C1P1和C1P2的极角。有了极角，就可以很方便地计算出P1和P2的坐标了。 代码如下: #include #include #include using namespace std; struct Point { double x,

You can Solve a Geometry Problem too Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7732    Accepted Submission(s): 3775 Problem Descri

Intersecting Lines Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 11307   Accepted: 5110 Description We all know that a pair of distinct points on a plane def

Wall Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 31844   Accepted: 10756 Description Once upon a time there was a greedy King who ordered his chief Archi