HDU6055-Regular polygon
来源:互联网 发布:编程判断正整数 编辑:程序博客网 时间:2024/06/14 05:37
Regular polygon
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 685 Accepted Submission(s): 247
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个二维平面上的整数点,问这些整数点能形成几个正多边形
解题思路:因为是整数点,所以其实只能是正方形,然后可以枚举正方形的对角线,然后判断另外两点存不存在即可(一开始判断两点存不存在的数组开的不够大,出现越界,WA了)
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <map>#include <cmath>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;const LL mod = 1e9 + 7;struct point{ int x,y;} p[505];int n;int vis[205][205];int main(){ while(~scanf("%d",&n)) { memset(vis,0,sizeof vis); for(int i=1; i<=n; i++) { scanf("%d%d",&p[i].x,&p[i].y); vis[p[i].x+100][p[i].y+100]=1; } int ans=0; for(int i=1; i<=n; i++) { for(int j=i+1; j<=n; j++) { point tmp; tmp.x=(p[i].x+p[j].x+p[j].y-p[i].y); tmp.y=(p[i].y+p[j].y+p[i].x-p[j].x); if(tmp.x%2!=0||tmp.y%2!=0) continue; tmp.x/=2,tmp.y/=2; if(tmp.x < -100 || tmp.x > 100 || tmp.y < -100 || tmp.y > 100 || !vis[tmp.x+100][tmp.y+100]) continue; tmp.x=(p[i].x+p[j].x+p[i].y-p[j].y); tmp.y=(p[i].y+p[j].y+p[j].x-p[i].x); if(tmp.x%2!=0||tmp.y%2!=0) continue; tmp.x/=2,tmp.y/=2; if(tmp.x < -100 || tmp.x > 100 || tmp.y < -100 || tmp.y > 100 || !vis[tmp.x+100][tmp.y+100]) continue; ans++; } } printf("%d\n",ans/2); } return 0;}
阅读全文
0 0
- HDU6055 Regular polygon【哈希】
- HDU6055-Regular polygon
- HDU6055(Regular polygon)
- HDU6055-Regular polygon
- hdu6055--Regular polygon
- HDU6055 Regular polygon(思路)
- HDU6055-Regular polygon 简单平面几何
- hdu6055 Regular polygon【思维+几何基础】
- hdu6055 17多校二1011 Regular polygon
- hdu6055 Regular polygon(简单计算几何)
- HDU6055 Regular polygon +多校联赛第二场
- Hdu6055 Regular polygon(2017多校第2场)
- HDU6055 Regular polygon(2017多校第二场)
- HDU6055 Regular polygon 2017 Multi-University Training Contest
- hdu6055—Regular polygon(正方形的判定)
- 2017多校训练Contest2: 1011 Regular polygon hdu6055
- 2017杭电多校联赛第二场-Regular polygon (hdu6055)判断点集能构成多少个正方形
- HDU6055 Regular polygon(计算几何,2017 HDU多校联赛 第2场)
- PHP中的时间日期函数
- 后台调用接口
- JDOM读取XML配置文件信息
- 不可继。
- D
- HDU6055-Regular polygon
- 【京东】会员激励体系,会员体系结构分析
- stc开发板程序烧写
- UVALive2536 POJ1248 HDU1015 ZOJ1403 Safecracker【密码+暴力】
- hash哈希--简单说
- spring源码(4)Register the bean definitions(3)
- ubuntu 16.04 安装caffe的教程
- BigInteger
- Vue 兄弟组件通信(不使用Vuex)