xws117的专栏

# 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度 用外角来求正整数

# include # include # define eps 1e-8 struct 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

# 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=

# include # include # include using namespace std; # define eps 1e-8 int 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)

# include # include # include using namespace std; # define eps 1e-8 int zero(double x) { if(x>eps) return 1; if(x<-eps) return -1; return 0; } struct node { double x,y; }vex[109]

小艾在努力神一样的想法 不对 是他的

# 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);

传说中的线段树 传说中的

# 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

# 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

# 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)

# 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

# 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)*(

# include # include # include # define maxn 100009 using 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,

# include # include # include # define eps 1e-6 using 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

# 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);

# 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.

# 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)-

# 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 ()

# include # define eps 1e-8 struct 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

# 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);