lesileqin的博客

POJ 1269 Intersecting Lines【传送门】 Intersecting Lines Time Limit:1000MS Memory Limit:10000K Total Submissions:20497 Accepted:8658 Description We all know that a pair of disti...

POJ 2138 TOYS 【传送门】 Time Limit:2000MS Memory Limit:65536K Total Submissions:20891 Accepted:9758 Description Calculate the number of toys that land in each bin of a partitione...

POJ 2398 Toy Storage 【传送门】 Toy Storage Time Limit:1000MS Memory Limit:65536K Total Submissions:7764 Accepted:4619 Description Mom and dad have a problem: their child, Reza, ...

1.快速排序实验 两条线段有且仅有一个公共点，且这个点不是任何一条线段的端点时，称这两条线段是严格相交的。快速排斥实验能很快的排除掉线段不相交的情况，但并没法成为线段相交的充要条件，在快速排斥实验之后接上跨立实验就能完全的判断两线段是否相交，但其实只用跨立实验这一种办法也能作为判断线段相交的充要条件。 判断以这两个点为对角线的矩形和另两个点决定的矩形是否相交 通过快速排斥实验，那么矩形相...

POJ 2653 Pick-up sticks 【传送门】 Time Limit:3000MS Memory Limit:65536K Total Submissions:15915 Accepted:5999 Description Stan has n sticks of various length. He throws them one ...

#include<iostream> #include<complex> #include<cmath> #include<cstdio> #include<cstring> #include<vector> using namespace std; #define eps 1e-9 #define inf 99999999...