queque_heiya的博客

模板--判断两条线段是否相交--计算几何； 两个结构体表示的是该条直线的A,B两个端点； const int maxa=1e2+10; const double pi=0.00000001; struct nodea{ int x,y; }a[maxa]; struct nodeb{ int x,y; }b[maxa]; bool check(nodea a,nodeb b,nodea c,nodeb d){ if(!(min(a.x,b.x)<=max(c.x,d.x) &amp

You are to write a program that has to decide whether a given line segment intersects a given rectangle. An example: line: start point: (4,9) end point: (11,2) rectangle: left-top: (1,5) right-bottom: (7,1) The line is said to intersect the rectangle if t.

On the circuit board, there are lots of circuit paths. We know the basic constrain is that no two path cross each other, for otherwise the board will be burned. Now given a circuit diagram, your task is to lookup if there are some crossed paths. If not fin

Nowadays all circuses in Berland have a round arena with diameter 13 meters, but in the past things were different. In Ancient Berland arenas in circuses were shaped as a regular (equiangular) polygo...

One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its edges ...

There are many secret openings in the floor which are covered by a big heavy stone. When the stone is lifted up, a special mechanism detects this and activates poisoned arrows that are shot near the o...