代码改变世界

传送门Kadj Squares Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 2937 Accepted: 1151 DescriptionIn this problem, you are given a sequence S1, S2, …, Sn of squares of different siz

传送门 CollisionTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 866    Accepted Submission(s): 327Special JudgeProblem Description There’s a round

传送门SkycityTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 538    Accepted Submission(s): 166Problem Description The world’s new tallest building

传送门 Peter and Bob are playing a “Points” game on a math sheet of paper. Peter places a few points on the paper — grid nodes. Bob wants to surround them with a polygon so that all marked nodes are lyin

传送门1131 - 喵哈哈村的几何大师╰☆莣メ誋こ月Time Limit：1s Memory Limit：256MByteSubmissions：280Solved：60DESCRIPTION╰☆莣メ誋こ月是月大叔的ID，他是一个掌握着429种几何画法的的几何大师，最擅长的技能就是搞事，今天他又要开始搞事了。给

传送门 小马承包了一个果园，想修一个围栏，但是不希望砍掉任何的果树。对于给出的所有的果树的坐标，计算一下最小的围住所有的果树的围栏的长度。输入数据的第一行包括一个整数 N（0≤ N ≤10,000）表示农夫约翰想要围住的放牧点的数目。接下来 N 行，每行由两个由空格分隔的实数组成，Xi 和 Yi，对应平面上的放牧点坐标（-1,000,000 ≤

传送门 An Easy Physics ProblemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2322    Accepted Submission(s): 469Problem Description On an infinite

传送门 Matt is a big fan of logo design. Recently he falls in love with logo made up by rings. The following figures are some famous examples you may know. A ring is a 2-D figure bounded by two circl

传送门 RebuildTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2483    Accepted Submission(s): 548Problem Description Archaeologists find ruins of

传送门Just do itTime Limit: 5000/2500 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 851    Accepted Submission(s): 485Problem Description There is a nonnegative integ

传送门 Regular polygonTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1187    Accepted Submission(s): 461Problem Description On a two-dimensional p

传送门You have got a cylindrical cup. Its bottom diameter is 2 units and its height is 2 units as well.The height of liquid level in the cup is d (0 ≤ d ≤ 2). When you incline the cup to the maximal angle

计算几何： 求给定平面直角坐标系中的一个圆，求圆内（可以在边界上）离圆心最远的整点。

计算几何

传送门 Beauty Contest Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 33435 Accepted: 10361 DescriptionBessie, Farmer John’s prize cow, has just won first place in a bovine beau

传送门 D. Bicycle Race time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Maria participates in a bicycle race.The speedway takes place on the s

传送门 Two Cylinders Special Judge Time Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others) Submit Statistic Next Problem Problem Description In this problem your task is very

传送门 题目大意： 给一个数N，然后每行3个数，前两个数十坐标，后面的一个数区分是 ‘+’ 还是’o’，0代表的是’o’，1代表的是’+’.然后判断是不是能够有一条线把这两部分分开也就是线的两边都是一样的标识符。如果能输出1， 否则输出 0.解题思路： 其实，我们可以将’o’代表的所有的点构成一个凸包，将’+’代表的所有的点构成一个凸包，判断这两个凸包是不是有相交就行了。My Code：#

传送门平面上有N个圆，他们的圆心都在X轴上，给出所有圆的圆心和半径，求有多少对圆是相离的。 例如：4个圆分别位于1, 2, 3, 4的位置，半径分别为1, 1, 2, 1，那么{1, 2}, {1, 3} {2, 3} {2, 4} {3, 4}这5对都有交点，只有{1, 4}是相离的。 Input 第1行：一个数N，表示圆的数量(1 <= N <= 50000) 第2 - N + 1行：每

传送门平面上有N个点，任意2个点确定一条直线，求出所有这些直线中，斜率最大的那条直线所通过的两个点。 （点的编号为1-N，如果有多条直线斜率相等，则输出所有结果，按照点的X轴坐标排序，正序输出。数据中所有点的X轴坐标均不相等） Input 第1行，一个数N，N为点的数量。(2 <= N <= 10000) 第2 - N + 1行：具体N个点的坐标，X Y均为整数(-10^9 <= X,Y <

传送门 Problem Description Given four points ABCD, if ABCD is a tetrahedron, calculate the inscribed sphere of ABCD.Input Multiple test cases (test cases ≤100).Each test cases contains a line of 12 int

传送门 div class=”ptt” lang=”en-US”>TransmittersTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 5088Accepted: 2686DescriptionIn a wireless network with multiple transmitters sending on the sam

传送门 A. New Year Table time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Gerald is setting the New Year table. The table has the form of a c

传送门 给出三维空间上的四个点（点与点的位置均不相同），判断这4个点是否在同一个平面内（4点共线也算共面）。如果共面，输出”Yes”，否则输出”No”。 Input 第1行：一个数T，表示输入的测试数量(1 <= T <= 1000) 第2 - 4T + 1行：每行4行表示一组数据，每行3个数，x, y, z, 表示该点的位置坐标(-1000 <= x, y, z <= 1000)。 Ou

传送门 Max AngleTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 704    Accepted Submission(s): 253Problem Description Given many points in a plan

传送门 Teacher Mai has a kingdom with the infinite area. He has n students guarding the kingdom. The i-th student stands at the position (xi,yi), and his walking speed is vi. If a point can be rea