hdu 6055 Regular polygon(判断正方形)(2017 Multi-University Training Contest
来源:互联网 发布:js object添加元素 编辑:程序博客网 时间:2024/06/05 18:44
Regular polygon
Problem Description
On a two-dimensional plane, give you n integer points. Your task is to figure out how many different regular polygon these points can make.
Input
The input file consists of several test cases. Each case the first line is a numbers N (N <= 500). The next N lines ,each line contain two number Xi and Yi(-100 <= xi,yi <= 100), means the points’ position.(the data assures no two points share the same position.)
Output
For each case, output a number means how many different regular polygon these points can make.
Sample Input
4
0 0
0 1
1 0
1 1
6
0 0
0 1
1 0
1 1
2 0
2 1
Sample Output
1
2
官方题解:
代码:
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;const int maxn=1000+5;struct point{ int x,y; point() {} point(int a,int b) { x=a,y=b; }} pt[maxn];int vis[maxn][maxn];int n;point solve(point p1,point p2){ int tx=p2.x-p1.x; int ty=p2.y-p1.y; return point(p1.x-ty,p1.y+tx);}int main(){ while(~scanf("%d",&n)) { memset(vis,0,sizeof(vis)); for(int i=0; i<n; ++i) { scanf("%d%d",&pt[i].x,&pt[i].y); pt[i].x+=400; pt[i].y+=400; vis[pt[i].x][pt[i].y]=1; } int ans=0; for(int i=0; i<n; ++i) for(int j=0; j<n; ++j) { if(i==j) continue; point p1=solve(pt[i],pt[j]); if(!vis[p1.x][p1.y]) continue; point p2=solve(p1,pt[i]); if(vis[p2.x][p2.y]) ++ans; } printf("%d\n",ans/4); } return 0;}
ps:这种判断正方形的方法也是一种套路。。
阅读全文
2 0
- hdu 6055 Regular polygon(判断正方形)(2017 Multi-University Training Contest
- HDU 6055 Regular polygon(计算几何+思维)——2017 Multi-University Training Contest
- HDU6055 Regular polygon 2017 Multi-University Training Contest
- HDU_【2017 Multi-University Training Contest 2】——1011 Regular polygon
- HDU 3068 2017 Multi-University Training Contest
- HDU 6034 & 2017 Multi-University Training Contest
- hdu 6034 2017 Multi-University Training Contest
- HDU 3065 2017 Multi-University Training Contest
- HDU 6047 2017 Multi-University Training Contest
- HDU 6052 2017 Multi-University Training Contest
- HDU 6058 2017 Multi-University Training Contest
- HDU 6078 2017 Multi-University Training Contest
- (hdu 6078)2017 Multi-University Training Contest
- HDU 6055 Regular polygon (找正方形)
- hdoj 6055(2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- jQuery笔记(操作DOM)
- Fire Game
- 程序设计和C语言以及算法
- Bing It On (Kattis
- Vue2.0 事件发射与接收
- hdu 6055 Regular polygon(判断正方形)(2017 Multi-University Training Contest
- csu1587 爬楼梯
- 打印变长tuple中的所有元素值
- CSU-ACM2017暑期训练3-递推与递归I
- 第二章:算法-----程序的灵魂
- GOP/ 码流 /码率 / 比特率 / 帧速率 / 分辨率的区别与联系
- 图片转化成base64字符串
- 【NOIP2017】SummerTraining0721
- 判断有无网路无网跳转