hdu6055
来源:互联网 发布:2017格里芬体测数据 编辑:程序博客网 时间:2024/05/21 09:12
Regular polygon
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1386 Accepted Submission(s): 529
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思路:这题其实是找正方形有多少个就可以了,已知两个点就可以枚举其他点是否和给出的一样,最后还要除以8。代码:#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>#include <cmath>#include <stdlib.h>#include <vector>#include <queue>#include <stack>using namespace std;const int MOD=1e9+7;vector<int>a1;vector<int>a2;int v[100005];int x[3005],y[3005];int ma[2055][2055];int main(){ int n; while(scanf("%d",&n)!=EOF) { int i,j; memset(ma,0,sizeof(ma)); for(i=0;i<n;i++) { scanf("%d %d",&x[i],&y[i]); x[i]+=300; y[i]+=300; ma[x[i]][y[i]]=1; } long long int sum=0; for(i=0;i<n;i++) { for(j=0;j<n;j++) { if(i==j)continue; int a=x[j]-x[i]; int b=y[j]-y[i]; if(x[i]-b>=0&&y[i]+a>=0&&x[j]-b>=0&&y[j]+a>=0) if(ma[x[i]-b][y[i]+a]&&ma[x[j]-b][y[j]+a]) sum++; if(x[i]+b>=0&&y[i]-a>=0&&x[j]+b>=0&&y[j]-a>=0) if(ma[x[i]+b][y[i]-a]&&ma[x[j]+b][y[j]-a]) sum++; } } cout<<sum/8<<endl; } return 0;}
阅读全文
0 0
- hdu6055
- HDU6055 Regular polygon【哈希】
- HDU6055(数学题寻找正多边形)
- HDU6055-Regular polygon
- HDU6055(Regular polygon)
- HDU6055-Regular polygon
- hdu6055--Regular polygon
- HDU6055 Regular polygon(思路)
- HDU6055-Regular polygon 简单平面几何
- HDU6055——多校2017
- hdu6055 Regular polygon【思维+几何基础】
- HDU6055 2017 Multi-University Training Contest
- hdu6055 17多校二1011 Regular polygon
- hdu6055 Regular polygon(简单计算几何)
- HDU6055 Regular polygon +多校联赛第二场
- HDU6055空间内n个点能组成多少个正方形
- Hdu6055 Regular polygon(2017多校第2场)
- HDU6055 Regular polygon(2017多校第二场)
- oracle 10.2.0.1 升级到10.2.0.4
- 获取近半年月份
- (1)简单数组
- HDU 6053 TrickGCD (莫比乌斯函数)
- Java jdbc 封装反射类(仅有增删改)
- hdu6055
- 【Ex.】给定s1 = AABCD和s2 = BCDAA,返回1,给定s1=abcd和s2=ACBD,返回0.
- Linux环境下搭建jenkins平台
- Zen Coding快速编写HTML代码
- filter过滤器,处理登录session长时失效问题
- 图像识别之卷积讲解
- RecyclerView的简单使用
- HDU1205 吃糖果
- 小米推送常见问题