HDU 6055 组合正多边形问题
来源:互联网 发布:ubuntu 16.04改中文 编辑:程序博客网 时间:2024/06/11 19:35
Regular polygon
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 220 Accepted Submission(s): 86
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
40 00 11 01 160 00 11 01 12 02 1
Sample Output
12
Source
2017 Multi-University Training Contest - Team 2
题意:输入n个点,要求出这些点能组成多少个正多边形(边长内角全部相等)而且是整数点,那么既然是整数点,那么组成的图形只能是正方形
所以只要枚举两个点,旋转90度去找另外两个点是否存在,最后答案除4就可以了
#include<bits/stdc++.h>using namespace std;#define MAXN 800struct point{int x,y;}p[MAXN];int ans;int has[MAXN][MAXN];point change(point a,point b){int x = a.x - b.x;int y = a.y - b.y;struct point c;c.x = b.x - y;c.y = b.y + x;return c;}bool isHas(point a){if(has[a.x][a.y])return true;return false;} bool solve(int i,int j){point a = p[i];point b = p[j];point c = change(a,b);point d = change(b,c);if(isHas(c) && isHas(d))return true;return false;}int main(){int n;while(scanf("%d",&n) != EOF){memset(has,0,sizeof(has));for(int i = 1;i <= n;i++){scanf("%d %d",&p[i].x,&p[i].y);p[i].x += 300;p[i].y += 300;has[p[i].x][p[i].y] = 1;}ans = 0;for(int i = 1;i <= n;i++){for(int j = 1;j <= n;j++){if(i != j && solve(i,j)){ans++;}}}printf("%d\n",ans / 4);}return 0;}
阅读全文
0 0
- HDU 6055 组合正多边形问题
- 正多边形
- HDU 6055-Regular polygon (判断n个整数点能够成多少个正多边形)
- HDU 4195 Regular Convex Polygon(正多边形)
- HDU 2519 新生晚会(组合问题)
- HDU 4000 Fruit Ninja (树状数组+组合问题)
- HDU 25919 新生晚会(水题组合问题)
- 组合问题!
- 组合问题
- 组合问题
- 组合问题
- 组合问题
- 组合 问题
- 组合问题
- 组合问题
- 组合问题
- c语言/c++编程题之运动的圆 沿正多边形扫过的面积问题
- 组合数学第二发 错排问题 hdu 2049 + hdu 2068
- HDU6043 KazaQ's Socks【规律】
- (四)View的控件架构
- kafka常用命令
- js问题解决
- Hive 同步数据
- HDU 6055 组合正多边形问题
- (译)OpenGL ES2.0 – Iphone开发指引
- 个人信息
- React-Native优化之PureComponent
- JSP其他主题
- WKWebView禁止捏合的方法
- POJ 2502 Subway(将各种数据转化成图+最短路+迪杰斯特拉算法)
- (五)View的测量 MeasureSpec类
- git版本控制