连接
摘要: 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 阅读全文
posted @ 2013-08-01 21:31 朱群喜_QQ囍_海疯习习 阅读(231) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2013-08-01 21:27 朱群喜_QQ囍_海疯习习 阅读(243) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2013-08-01 21:17 朱群喜_QQ囍_海疯习习 阅读(225) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2013-08-01 20:56 朱群喜_QQ囍_海疯习习 阅读(213) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2013-08-01 20:46 朱群喜_QQ囍_海疯习习 阅读(373) 评论(0) 推荐(0) 编辑
摘要: 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. 阅读全文
posted @ 2013-08-01 20:33 朱群喜_QQ囍_海疯习习 阅读(221) 评论(0) 推荐(0) 编辑
摘要: 单色原理时间限制: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(... 阅读全文
posted @ 2013-08-01 20:26 朱群喜_QQ囍_海疯习习 阅读(274) 评论(0) 推荐(0) 编辑
Map