xtulollipop

Problem Description Given n points which are in three-dimensional space(without repetition).Please find out how many distinct Special Tetrahedron among them. A tetrahedron is called Special Tetrahedro

Problem Description There were two families in the village — family A and family B, while these two families didn’t get along well with each other. Now the head of the village decided to make a road t

Problem Description 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 b

转载请注明出处 http://blog.youkuaiyun.com/xtulollipop#include<cstdio>#include<cmath>#include<cstring>#include<iostream>#include<algorithm>#include<cstdlib>#include<queue>#include<vector>#include<map>#inclu

Problem Description There is a big round cake on the ground. A small ant plans to steal a small piece of cake. He starts from a certain point, reaches the cake, and then carry the piece back home. He

Problem Description Once upon a time Matt went to a small town. The town was so small and narrow that he can regard the town as a pivot. There were some skyscrapers in the town, each located at positi

半平面交

Problem Description XXX is playing an interesting game which is based on a 2D plane. In this game, he is required to shoot an airplane. The airplane flies horizontally. The shape of it can be regarded

25 May, 1997, near Elcino-Borisovo place, Jandal region, strange signs were found in the field… Witness: “First, I saw only one UFO. It was shining with cold-blue light.Closer to the center of the ob

DescriptionYou are given two rectangles on a plane. The centers of both rectangles are located in the origin of coordinates (meaning the center of the rectangle’s symmetry). The first rectangle’s sides

Problem Description Archaeologists find ruins of Ancient ACM Civilization, and they want to rebuild it.The ruins form a closed path on an x-y plane, which has n endpoints. The endpoints locate on (x1,

DescriptionThousands 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 the o

转载请注明出处：http://blog.youkuaiyun.com/xtulollipop#include<cstdio>#include<cmath>#include<cstring>#include<iostream>#include<algorithm>#include<cstdlib>#include<queue>#include<map>#include<stack>#includ

Given the Cartesian coordinates of n(>0) 2-dimensional points, write a program that computes the area of their smallest bounding rectangle (smallest rectangle containing all the given points). Input

今天遇到了个3维凸包问题的题，网上找了2个模板。。感谢菊苣们。。不要嫌弃我转载一下下啊。。。orz/*给出三维空间中的n个顶点,求解由这n个顶点构成的凸包表面的多边形个数.增量法求解:首先任选4个点形成的一个四面体,然后每次新加一个点,分两种情况: 1> 在凸包内,则可以跳过 2> 在凸包外,找到从这个点可以"看见"的面,删除这些面,然后对于一边没有面

DescriptionGiven n segments 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

Problem Description cjj is fun with math problem. One day he found a Olympic Mathematics problem for primary school students. It is too difficult for cjj. Can you solve it? Give you the side length o

Description给定两个简单多边形,你的任务是判断二者是否有面积非空的公共部分。如下图,(a)中的两个矩形只有一条公共线段,没有公共面积。 在本题中,简单多边形是指不自交(也不会接触自身)、不含重复顶点并且相邻边不共线的多 边形。 注意:本题并不复杂,但有很多看上去正确的算法实际上暗藏缺陷,请仔细考虑各种情况。 Input 输入包含不超过 100 组数据。每组数据包含两行,每个多边形占一行

#include<cstdio>#include<cmath>#include<cstring>#include<iostream>#include<algorithm>#include<cstdlib>#include<queue>#include<vector>#include<map>#include<stack>#include<set>#define e exp(1.

Description I work at NASA outer space rescue team which needs much courage and patient. In daily life, I always receive a lot of mission, and I must complete it right now. Today, team leader announc

Description There are N points in 3D-space which make up a 3D-Convex hull*. How many faces does the 3D-convexhull have? It is guaranteed that all the points are not in the same plane.In case you don’t

DescriptionIn year 2008 of the Cosmic Calendar, the Aliens send a huge armada towards the Earth seeking after conquest. The humans now depend on their ultimate weapon to retain their last hope of survi

Bobo 有一个三角形和一个矩形，他想求他们交的面积。 具体地，三角形和矩形由 8 个整数 x1,y1,x2,y2,x3,y3,x4,y4 描述。表示三角形的顶点坐标是 (x1,y1),(x1,y2),(x2,y1)，矩形的顶点坐标是 (x3,y3),(x3,y4),(x4,y4),(x4,x3). 输入 输入包含不超过 30000 组数据。 每组数据的第一行包含 4 个整数 x1,y1,x2

Problem Description In Geometry, the problem of track is very interesting. Because in some cases, the track of point may be beautiful curve. For example, in polar Coordinate system, ρ=cos3θ is like ro

An Easy Physics Problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1501 Accepted Submission(s): 289Problem Description On an infinite