2017多校训练Contest2: 1011 Regular polygon hdu6055
来源:互联网 发布:千里眼扫描软件 编辑:程序博客网 时间:2024/06/06 00:19
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
数正方形个数
直接枚举两个点后看另外两个点是否存在即可。最后把重复统计的次数除掉
#include<queue>#include<vector>#include<cstdio>#include<string>#include<cstring>#include<cassert>#include<iostream>#include<algorithm>using namespace std;int mp[801][801];int x[601],y[601];int main(){int n;while(scanf("%d",&n)!=EOF){memset(mp,0,sizeof(mp));int i,j;for(i=1;i<=n;i++){scanf("%d%d",&x[i],&y[i]);x[i]+=400;y[i]+=400;mp[x[i]][y[i]]=1;}int ans=0;for(i=1;i<=n;i++){for(j=i+1;j<=n;j++){//if(i==j)//continue;int dx=x[j]-x[i],dy=y[j]-y[i];//if(v[dx][dy]||v[dy][dx])//continue;//v[dx][dy]=true;//v[dy][dx]=true;if(mp[x[j]+dy][y[j]-dx]&&mp[x[i]+dy][y[i]-dx])ans++;if(mp[x[j]-dy][y[j]+dx]&&mp[x[i]-dy][y[i]+dx])ans++;}}printf("%d\n",ans/4);}return 0;}
阅读全文
0 0
- 2017多校训练Contest2: 1011 Regular polygon hdu6055
- 2017多校训练第二场 hdu6055 Regular polygon (几何+暴力)
- HDU-2017 多校训练赛2-1011-Regular polygon
- 2017 多校训练第二场 HDU 6055 Regular polygon
- HDU 6055 (2017 多校训练赛2 1011)Regular polygon
- HDU (6055)Regular polygon (2017多校训练赛1011)
- 2017多校训练Contest2: 1001 Captain is coding hdu6045
- 2017多校训练Contest2: 1003 Maximum Sequence hdu6047
- 2017多校训练Contest2: 1009 TrickGCD hdu6053
- 2017多校训练Contest2: 1006 Funny Function hdu6050
- HDU6055 Regular polygon(2017多校第二场)
- hdu6055 17多校二1011 Regular polygon
- HDU6055 Regular polygon【哈希】
- HDU6055-Regular polygon
- HDU6055(Regular polygon)
- HDU6055-Regular polygon
- hdu6055--Regular polygon
- HDU6055 Regular polygon(思路)
- ROS查看版本
- EmotioNet_
- 嵌入式之U-Boot学习笔记
- java对实体类列表进行方法内排序,不修改数据查询方式
- C#多线程学习笔记之(abort与join配合使用)
- 2017多校训练Contest2: 1011 Regular polygon hdu6055
- Spring Cloud-Eureka注册发现高可用(学习实践)
- memcached全面剖析–4. memcached的分布式算法
- 神奇的口袋(百练2755)
- Python编程之基本方法
- hydra暴力破解ssh密码
- jquery妙招去除html标记
- C#反射技术的简单操作(读取和设置类的属性)
- 五、迭代器--迭代器配接器