HDU 2017 多校联赛2 1011 Regular polygon
来源:互联网 发布:mybatis 配置打印sql 编辑:程序博客网 时间:2024/06/07 10:03
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
题目大意:
给一个数n,接下来有n个点,求这些点能组成几个正方形。
c++
#include<cstdio>#include<cstring>#include<iostream>using namespace std;int m[500][500];struct Point{ int x,y;}s[555];int solve(Point a,Point b){ int x=a.x-b.x; int y=a.y-b.y; int ans=0; if(a.x+y>=0&&a.y-x>=0&&b.x+y>=0&&b.y-x>=0&&m[a.x+y][a.y-x]&&m[b.x+y][b.y-x]) ans++; if(a.x-y>=0&&a.y+x>=0&&b.x-y>=0&&b.y+x>=0&&m[a.x-y][a.y+x]&&m[b.x-y][b.y+x]) ans++; return ans;}int main(){ int n,a,b; while(~scanf("%d",&n)) { memset(m,0,sizeof(m)); for(int i=0; i<n; i++) { scanf("%d%d",&a,&b); a+=200; b+=200; s[i].x=a; s[i].y=b; m[a][b]=1; } int ans=0; for(int i=0; i<n; i++) for(int j=i+1; j<n; j++) if(i!=j) ans+=solve(s[i],s[j]); printf("%d\n",ans/4); }}
阅读全文
1 0
- HDU 2017 多校联赛2 1011 Regular polygon
- HDU 2017多校联赛-Regular polygon
- hdu 多校联赛 Regular polygon
- HDU6055 Regular polygon(计算几何,2017 HDU多校联赛 第2场)
- HDU 6053 TrickGCD+6055 Regular polygon【2017多校联赛2】
- Regular polygon(2017多校联赛2。 计算几何)
- 17暑假多校联赛2.11 HDU 6055 Regular polygon
- HDU-2017 多校训练赛2-1011-Regular polygon
- HDU6055 Regular polygon +多校联赛第二场
- HDU 2017 多校联合训练赛2 1011 6055 Regular polygon map&pair
- (2017多校2)1011/hdu-6055 Regular polygon(计算几何)
- 2017 HDU 多校联合赛 Regular polygon
- 2017多校联合第二场 1011题 hdu 6055 Regular polygon 计算几何
- HDU 6055 (2017 多校训练赛2 1011)Regular polygon
- 2017 杭电多校联赛第二场 1011 Regular polygon(多个点求正方形个数)POJ 2002
- 2017多校2 1011 Regular polygon
- 2017第二次多校联合Regular polygon
- 2017 多校训练第二场 HDU 6055 Regular polygon
- IOC容器的简单介绍
- 【QT】QPA
- 定制自己的Unity场景编辑工具界面(一)
- android 检测USB是U盘还是外设
- 面试题
- HDU 2017 多校联赛2 1011 Regular polygon
- CF766E:Mahmoud and a xor trip(树形dp)
- SpringBoot使用Ckediter上传图片
- Unity与ARKit插件实践评测总结
- python基础之list,zip,array的区别
- 计算机视觉----图像底层特征提取之边缘提取(二) Canny算法
- 解决OKHttp3 报OKHTTP javax.net.ssl.SSLHandshakeException错误
- Java冒泡排序的6种写法(1)
- HTML 标题段落