几何
文章平均质量分 84
Tian_Fei
111
展开
-
Lan Xiang's Square
描述 Excavator technology which is strong, fast to Shandong to find Lan Xiang. Then the question comes.. :) for this problem , i will give you four points. you just judge原创 2014-10-23 21:44:21 · 478 阅读 · 0 评论 -
nyoj 1234 签到题
题意: 半径为R的大圆中是否 可以放置n个半径为r的小圆,且小圆贴着大圆的边缘放置思路:半径为R的大圆中放置n个小圆 半径为r1,当r1>=r时满足题意,上面那张图 构造三角形解边长code:#include #include #include#include#includeusing namespace std;const double pi = 3.141原创 2015-08-09 15:11:31 · 693 阅读 · 0 评论 -
Squares(存在多少正方形,暴力枚举 )
SquaresTime Limit: 3500MS Memory Limit: 65536KTotal Submissions: 17128 Accepted: 6513DescriptionA square is a 4-sided polygon whose sides have equal length and原创 2015-05-01 16:27:33 · 576 阅读 · 0 评论 -
Space Ant
Space AntTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3322 Accepted: 2121DescriptionThe most exciting space discovery occurred at the end of the 20原创 2015-04-20 09:58:03 · 358 阅读 · 0 评论 -
Ants poj 1852
AntsDescriptionAn army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the pole, it immediatelly falls off it. When原创 2015-04-07 21:37:09 · 338 阅读 · 0 评论 -
Grandpa's Estate
Grandpa's EstateTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11251 Accepted: 3102DescriptionBeing the only living descendant of his grandfather, Ka原创 2015-04-18 18:42:24 · 780 阅读 · 0 评论 -
Coverage 圆与直线的交点
CoverageTime Limit: 1000msMemory Limit: 32768KB64-bit integer IO format: %I64d Java class name: MainSubmit Status PID: 7536A cell phone user is travelling along a line s原创 2015-04-12 18:37:55 · 543 阅读 · 0 评论 -
Circular Area 两圆相交面积(模板)
Circular AreaTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5272 Accepted: 2100DescriptionYour task is to write a program, which, given two circles,原创 2015-04-14 10:28:38 · 562 阅读 · 0 评论 -
Open-air shopping malls 两圆面积相交,二分搜索半径
Open-air shopping mallsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2078 Accepted Submission(s): 745Problem DescriptionThe cit原创 2015-04-14 10:53:39 · 485 阅读 · 0 评论 -
斩bnuoj 直线与矩形的交点
斩Time Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainPrev Submit Status Statistics Discuss NextType: None原创 2015-04-13 19:22:18 · 1381 阅读 · 0 评论 -
promise me a medal(线段相交 && 求交点)
代码:#include#include#include #include#includeusing namespace std;struct node {double x,y;}st1,ed1,st2,ed2,s[4];double area(node ss1,node ee1,node ss2){ //return ss1.x*ee1.y-ss1.y*ee1.x;原创 2014-11-17 19:09:36 · 523 阅读 · 0 评论 -
nyist 最大四边形
代码:#include#include#include#include#define pi 1e-8using namespace std;int n;struct node{double x,y;}p[330];double area(node a,node b,node c){ return (a.x-b.x)*(c.y-b.y)-(c.x-b.x)*(a.y原创 2014-11-17 21:22:04 · 450 阅读 · 0 评论 -
德莱联盟(判断两点是否相交 nyist)
描述欢迎来到德莱联盟。。。。德莱文。。。德莱文在逃跑,卡兹克在追。。。。我们知道德莱文的起点和终点坐标,我们也知道卡兹克的起点和中点坐标,问:卡兹克有可能和德莱文相遇吗?,并且保证他们走的都是直线。输入几组数据,一个整数T表示T组数据每组数据 8个实数,分别表示德莱文的起点和终点坐标,以及卡兹克的起点和终点坐标输出如果可能 输出 Inte原创 2014-11-16 20:26:06 · 677 阅读 · 0 评论 -
nyist 三点顺序
描述现在给你不共线的三个点A,B,C的坐标,它们一定能组成一个三角形,现在让你判断A,B,C是顺时针给出的还是逆时针给出的?如:图1:顺时针给出图2:逆时针给出 输入每行是一组测试数据,有6个整数x1,y1,x2,y2,x3,y3分别表示A,B,C三个点的横纵坐标原创 2014-11-15 16:31:47 · 746 阅读 · 0 评论 -
hdu --- You can Solve a Geometry Problem too (线段相交问题)
Problem DescriptionMany geometry(几何)problems were designed in the ACM/ICPC. And now, I also prepare a geometry problem for this final exam. According to the experience of many ACMers, geometry probl转载 2014-10-10 20:15:30 · 454 阅读 · 0 评论 -
hdu Pick-up sticks 线段相交问题
Problem DescriptionStan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing throwing, Stan tries to find the top sticks, that is these sticks s原创 2014-10-11 18:13:49 · 607 阅读 · 0 评论 -
Lifting the Stone(多边形重心问题)
#include#include#includeusing namespace std;struct node{double x,y;};//double area(node a,node b)//{// return//}int main(){ int n,m,i; node p1,p2,p; //double tem,sare; c原创 2014-10-10 16:31:57 · 425 阅读 · 0 评论 -
多边形重心问题
描述在某个多边形上,取n个点,这n个点顺序给出,按照给出顺序将相邻的点用直线连接, (第一个和最后一个连接),所有线段不和其他线段相交,但是可以重合,可得到一个多边形或一条线段或一个多边形和一个线段的连接后的图形; 如果是一条线段,我们定义面积为0,重心坐标为(0,0).现在求给出的点集组成的图形的面积和重心横纵坐标的和;输入第一行有一个整数0每组数据第一行有一个整原创 2014-10-09 17:10:14 · 596 阅读 · 0 评论 -
hdu 4998 Rotate 计算几何 点的旋转
RotateTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 960 Accepted Submission(s): 448Special JudgeProblem DescriptionNoting原创 2015-10-12 15:12:50 · 533 阅读 · 0 评论