摘要： SegmentsTime Limit:1000MSMemory Limit:65536KTotal Submissions:8579Accepted:2608DescriptionGivennsegments in the two dimensional space, write a program, which determines if there exists a line such that after projecting these segments on it, all projected segments have at least one point in common.In 阅读全文

摘要： TOYSTime Limit:2000MSMemory Limit:65536KTotal Submissions:9350Accepted:4451DescriptionCalculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a problem - their child John never puts his toys away when he is finished playing with them. They gave John a rectangula 阅读全文

摘要： Bridge Across IslandsTime Limit:1000MSMemory Limit:65536KTotal Submissions:7632Accepted:2263Special JudgeDescriptionThousands of thousands years ago there was a small kingdom located in the middle of the Pacific Ocean. The territory of the kingdom consists two separated islands. Due to the impact of 阅读全文

摘要： #include#include#include#include#includeusing namespace std;struct Point { int x, y; Point(int x=0, int y=0):x(x),y(y) { }};typedef Point Vector;Vecto... 阅读全文

摘要： Problem E2D Geometry 110 in 1!This is a collection of 110 (in binary) 2D geometry problems.CircumscribedCircle x1 y1 x2 y2 x3 y3Find out the circumscribed circle of triangle (x1,y1)-(x2,y2)-(x3,y3). These three points are guaranteed to be non-collinear. The circle is formatted as (x,y,r) where (x,y) 阅读全文

摘要： CDog DistanceInputStandard InputOutputStandard OutputTwo dogs, Ranga and Banga, are running randomly following two different paths. They both run forT... 阅读全文

摘要： Little Joey invented a scrabble machine that he called Euler, after the great mathematician. In his primary school Joey heard about the nice story of how Euler started the study about graphs. The problem in that story was - let me remind you - to draw a graph on a paper without lifting your pen, and 阅读全文

摘要： Problem D Morley’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 intersected 阅读全文

摘要： Good NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 603Accepted Submission(s): 221 Problem DescriptionIf we sum up every digit of a number and the result can be exactly divided by 10, we say this number is a good number. You are required t 阅读全文

摘要： Recurrences Input:standard input Output:standard outputConsider recurrent functions of the following form:f(n) = a1f(n - 1) + a2f(n - 2) + a3f(n - 3) + ... + adf(n - d), for n > d. a1, a2, ..., ad- arbitrary constants.A famous example is the Fibonacci sequence, defined as: f(1) = 1, f(2) = 1, f(n 阅读全文