几何
xws117123
微博地址 http://weibo.com/2139773423/profile?rightmod=1&wvr=6&mod=personinfo
展开
-
Codeforces 270A - Fancy Fence
# include int s,t;int main (){ int n,a; scanf("%d",&n); while(n--) { scanf("%d",&a); if(360%(180-a)==0) printf("YES\n"); else printf("NO\n"); } return 0;}多边形形的外角和为360度 用外角来求正整数原创 2013-09-21 17:04:19 · 1069 阅读 · 0 评论 -
zoj 2551
# include # include # define eps 1e-8struct node{ double x,y;};struct line{ node a,b;}vex[100009];int w[100009];int zero(double x){ if(x>eps) return 1; if(x<-eps) return -1原创 2014-05-13 21:16:24 · 474 阅读 · 0 评论 -
zoj 1041 水题
# include # include struct node{ double x,y;}vex[156];double x,y,r;double cross(node a,node b,node c){ return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);}void solve(int n){ int sum=原创 2014-04-28 21:13:15 · 495 阅读 · 0 评论 -
zoj 1996
# include # include # include using namespace std;# define eps 1e-8int n,m;struct node{ double x,y;};struct line{ node a,b;}vex[1009];int cmp(line a,line b){ if(a.a.x==b.a.x)原创 2014-05-13 23:51:08 · 474 阅读 · 0 评论 -
zoj2352
# include # include # include using namespace std;# define eps 1e-8int zero(double x){ if(x>eps) return 1; if(x<-eps) return -1; return 0;}struct node{ double x,y;}vex[109]原创 2014-05-14 11:25:59 · 517 阅读 · 0 评论 -
zoj 2157
小艾在努力神一样的想法 不对 是他的原创 2014-05-25 18:58:01 · 589 阅读 · 0 评论 -
zoj 1974 1973
# include struct node{ double x,y;}vex[100000];int main (){ int n; while(scanf("%d",&n)!=EOF) { for(int i=0;i<n;i++) scanf("%lf%lf",&vex[i].x,&vex[i].y);原创 2014-05-25 15:45:35 · 508 阅读 · 0 评论 -
zoj 1128
传说中的线段树 传说中的原创 2014-05-26 15:40:16 · 505 阅读 · 0 评论 -
zoj2370
# include # include double eps=1e-12;double pi=acos(-1.0);int zero(double x,double y){ return fabs(x-y)<eps;}int main(){ //printf("%lf\n",pi); double a,a2,n,c; while(scanf("%lf原创 2014-05-27 11:05:44 · 589 阅读 · 0 评论 -
poj 1118
# include # include using namespace std;const double inf=1e20;struct node{ int x,y;}vex[709];double kk[709];double kkkk(node a,node b){ if(a.x==b.x) return inf; return (1.0)*(a.y原创 2014-05-19 15:02:39 · 485 阅读 · 0 评论 -
zoj 1010
# include # include # define eps 1e-6# include struct node{ double x,y;}vex[1009];int sign(double x){ if(x<-eps) return -1; if(x>eps) return 1; return 0;}int zero(double x)原创 2014-05-12 21:32:31 · 472 阅读 · 0 评论 -
poj 1569
# include # include struct node{ int x,y;}vex[20];int cross(node a,node b,node c){ return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);}int area(node a,node b,node c){ return abs(cross原创 2014-05-19 20:57:04 · 476 阅读 · 0 评论 -
zoj 2381
# include # include int n,m,x1,x2,y1,y2;struct node{ int x,y;};struct li{ node a,b; int sum;}line[2509];int cross(node a,node b,node c){ return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(原创 2014-04-29 22:23:18 · 562 阅读 · 0 评论 -
zoj2107
# include # include # include # define maxn 100009using namespace std;struct node{ double x,y;}vex[maxn],vex2[maxn];double min(double a,double b){ return a<b?a:b;}double dis(node a,原创 2014-05-01 16:26:51 · 519 阅读 · 0 评论 -
zoj 1081
# include # include # include # define eps 1e-6using namespace std;struct node{ double x,y;}vex[109];int n,m;int zero(double x){ return ((x)>0?(x):(-x))<eps;}double max(double x,do原创 2014-05-07 18:30:57 · 510 阅读 · 0 评论 -
poj2954
# include # include # include struct node{ int x,y;}a,b,c;int gcd(int m,int n){ return n==0?m:gcd(n,m%n);}int solve(node a,node b){ int m=abs(a.x-b.x); int n=abs(a.y-b.y);原创 2014-05-18 23:58:51 · 557 阅读 · 0 评论 -
zoj1392
# include # include struct node{ double x,y;};node inser(node a,node b,node c,node d){ node f=a; double t=((a.x-c.x)*(c.y-d.y)-(a.y-c.y)*(c.x-d.x))/((a.x-b.x)*(c.y-d.y)-(a.y-b.y)*(c.原创 2014-05-18 16:30:36 · 555 阅读 · 0 评论 -
poj 1654
# include # include # include # include # include using namespace std;char s[1000009];struct node{ int x,y;}vex[1000009];int cross(node a,node b,node c){ return (b.x-a.x)*(c.y-a.y)-原创 2014-05-19 13:08:37 · 442 阅读 · 0 评论 -
poj 1468
# include struct node{ int x1,x2,y1,y2;}vex[5009];int solve(int i,int j){ if(vex[i].x1>=vex[j].x1&&vex[i].x2=vex[j].y1&&vex[i].y2<=vex[j].y2) return 1; return 0;}int main ()原创 2014-05-19 13:36:35 · 674 阅读 · 0 评论 -
zoj1280
# include # define eps 1e-8struct node{ double x,y;};node a,b,c,d;int zero(double x){ if(x-eps) return 1; return 0;}double cross(node a,node b,node c){ return (b.x-a原创 2014-05-13 09:11:15 · 500 阅读 · 0 评论 -
zoj 2010
# include # include double a,b,c,d;double pi=acos(-1.0);int solve (){ double e=0.0; while(e*2.0<pi) { double ans1=c*cos(e)+d*sin(e); double ans2=c*sin(e)+d*cos(e);原创 2014-05-27 16:07:57 · 498 阅读 · 0 评论