摘要：
Morley's TheoremMorley’s Theorem Input:Standard InputOutput:Standard OutputMorley’s theorem states that that the lines trisecting the angles of an arbitrary plane triangle meet at the vertices of an equilateral triangle. For example in the figure below the tri-sectors of angles A, B and C has in 阅读全文
摘要：
Beauty ContestTime Limit:3000MSMemory Limit:65536KTotal Submissions:24431Accepted:7459DescriptionBessie, Farmer John's prize cow, has just won first place in a bovine beauty contest, earning the title 'Miss Cow World'. As a result, Bessie will make a tour of N (2 2 #include 3 #include 4 阅读全文
摘要：
Intersecting LinesTime Limit:1000MSMemory Limit:10000KTotal Submissions:8637Accepted:3915DescriptionWe all know that a pair of distinct points on a plane defines a line and that a pair of lines on a plane will intersect in one of three ways: 1) no intersection because they are parallel, 2) intersect 阅读全文
摘要：
打算转下来好好做计算几何了。原文地址：http://blog.sina.com.cn/s/blog_49c5866c0100f3om.html其实也谈不上推荐，只是自己做过的题目而已，甚至有的题目尚未AC，让在挣扎中。之所以推荐计算几何题，是因为，本人感觉ACM各种算法中计算几何算是比较实际的算法，在很多领域有着重要的用途 计算几何题的特点与做题要领： 1.大部分不会很难，少部分题目思路很巧妙 2.做计算几何题目，模板很重要，模板必须高度可靠。 3.要注意代码的组织，因为计算几何的题目很容易上两百行代码，里面大部分是模板。如果代码一片混乱，那么会严重影响做题正确率。 4.注意精度控制。 5.能 阅读全文
摘要：
RaidTime Limit:5000MSMemory Limit:65536KTotal Submissions:7473Accepted:2221DescriptionAfter successive failures in the battles against the Union, the Empire retreated to its last stronghold. Depending on its powerful defense system, the Empire repelled the six waves of Union's attack. After seve 阅读全文
摘要：
GroupTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 546Accepted Submission(s): 299 Problem DescriptionThere are n men ,every man has an ID(1..n).their ID is unique. Whose ID is i and i-1 are friends, Whose ID is i and i+1 are friends. These n men 阅读全文
摘要：
Arif inDhaka(First Love Part 2)Input:standard inputOutput:standard outputTime Limit:2 secondsOur hero Arif is now inDhaka(Look at problem10244 – First Loveif you want to know more about Arif, but that information is not necessary for this problem. In short, Arif is a brilliant programmer working atI 阅读全文
摘要：
Who's Aunt ZhangTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 125 Accepted Submission(s): 108 Problem DescriptionAunt Zhang, well known as 张阿姨, is a fan of Rubik’s cube. One day she buys a new one and would like to color it as a gift to sen 阅读全文
摘要：
Use of Function ArctanTime Limit:10000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description It's easy to know that arctan(1/2)+arctan(1/3)=arctan(1).The problem is,to some fixed number A,you have to write a program to calculate the minimum sum B+C.A,B and C are all positi 阅读全文
摘要：
Cube Problem Time Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 299EDescription Yaroslav, Andrey and Roman love playing cubes. Sometimes they get together and play cubes for hours and hours!Today they got together again and they are playing cube 阅读全文
摘要：
11806 - Cheerleaders Time limit: 2.000 secondsC Cheerleaders In most professional sporting events, cheerleaders play a major role in entertaining the spectators. Their roles are substantial during breaks and prior to start of play. The world cup soccer is no exception. Usually the cheerleaders form 阅读全文
摘要：
A Chess QueenProblem A Chess Queen Input:Standard InputOutput:Standard OutputYou probably know how the game of chess is played and how chess queen operates. Two chess queens are in attacking position when they are on same row, column or diagonal of a chess board. Suppose two such chess queens (one b 阅读全文
摘要：
11401 - Triangle CountingProblem G Triangle CountingInput:Standard InputOutput:Standard OutputYou are givennrods of length 1, 2…, n. You have to pick any 3 of them & build a triangle. How many distinct triangles can you make? Note that, two triangles will be considered different if they have at 阅读全文
摘要：
GCD Extreme (II)Input: Standard Input Output:Standard Output Given the value of N, you will have to find the value of G. The definition of G is given below: Here GCD(i,j) means the greatest common divisor of integer i and integer j. For those who have trouble understanding summation notation, the m. 阅读全文
摘要：
单色原理时间限制：3000 ms内存限制：65535 KB难度：4描述 给定空间里的n个点，其中没有三点共线。每两个点之间都可以用红色和黑色线段连接。如果一个三角形的三条边同色，则称这个三角形是单色三角形。对于给定的红色线段的列表，希望你找出单色三角形个数。 输入 第一行有一个整数n（3#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;const int M=1000010; int main(){ int i,y,n,x,T; scanf(... 阅读全文
