2017 Multi-University Training Contest
来源:互联网 发布:如何面试java应聘者 编辑:程序博客网 时间:2024/06/15 11:42
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=6055
题目大意: 在xy坐标轴上给n个点, n <= 500 (-100 <= xi, yi <= 100) 问这些点可以组成多少个不同的正多边形。
解题思路: 正多边形每个点都是整点的只有正方形, 所以暴力枚举两个点去判断是否可以形成正方形就可以了。 复杂度为O(n^2)。
#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<algorithm>using namespace std;const int MaxN = 1000;struct XX{int x, y;}a[MaxN + 5];bool vis[MaxN + 5][MaxN + 5];int n, ans;bool cmp(XX a, XX b){if(a.x == b.x) return a.y < b.y;else return a.x < b.x;}int main(){while(~scanf("%d", &n)){memset(vis, 0, sizeof(vis));ans = 0;for(int i = 1; i <= n; i++){scanf("%d %d", &a[i].x, &a[i].y);a[i].x += 100, a[i].y += 100;vis[a[i].x][a[i].y] = true;}sort(a + 1, a + 1 + n, cmp);for(int i = 1; i < n; i++){for(int j = i + 1; j <= n; j++){int lx = a[i].x - a[j].x;int ly = a[i].y - a[j].y;if(a[i].x - ly < 0 || a[j].x - ly < 0) continue;if(vis[a[i].x - ly][a[i].y + lx] && vis[a[j].x - ly][a[j].y + lx]) ans++;}}printf("%d\n", ans / 2);}return 0;}
阅读全文
0 0
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- Hibernate学习笔记 -- day03 使用JPA开发hibernate
- Second Write(JAVA继承与多态数据处理)
- blast2go本地数据库安装和使用
- Solr学习(5.4)-Solr实现SQL的查询与统计
- Babel 所有 插件Plugins,也就编码转换工具
- 2017 Multi-University Training Contest
- Binary Tree Level Order Traversal
- Cookie插件使用--记住用户名和密码
- Eclipse调试惯用10技巧
- python爬虫实战:抓取猫眼电影TOP100存放到MongoDB中
- 7.28 链式物理存储结构的实现
- hdu 6045 Is Derek lying?
- 磁盘读写与数据库的关系
- 对mybatis-generator扩展项目的配置使用介绍