Educational Codeforces Round 11 D. Number of Parallelograms
2016-05-21 22:16
423 查看
You are given n points on a plane. All the points are distinct and no three of them lie on the same line. Find the number of parallelograms with the vertices at the given points.
Input
The first line of the input contains integer n (1 ≤ n ≤ 2000) — the number of points.
Each of the next n lines contains two integers
(xi, yi) (0 ≤ xi, yi ≤ 109)
— the coordinates of the i-th point.
Output
Print the only integer c — the number of parallelograms with the vertices at the given points.
Example
Input
Output
Codeforces (c) C
题意:给你一堆点,问能组成多少个平行四边形。
分析:中点相等的两条不共线线段可以组成平行四边形。
#include <cstdio>
#include <iostream>
#include <utility>
#include <map>
using namespace std;
struct thing
{
int x,y;
} p[2005];
map <pair<int,int>,int> f;
int n,ans;
int main()
{
cin.sync_with_stdio(false);
cin>>n;
for(int i = 1;i <= n;i++) cin>>p[i].x>>p[i].y;
for(int i = 1;i <= n-1;i++)
for(int j = i+1;j <= n;j++)
{
ans += f[make_pair(p[i].x+p[j].x,p[i].y+p[j].y)];
f[make_pair(p[i].x+p[j].x,p[i].y+p[j].y)]++;
}
cout<<ans<<endl;
}
Input
The first line of the input contains integer n (1 ≤ n ≤ 2000) — the number of points.
Each of the next n lines contains two integers
(xi, yi) (0 ≤ xi, yi ≤ 109)
— the coordinates of the i-th point.
Output
Print the only integer c — the number of parallelograms with the vertices at the given points.
Example
Input
4 0 1 1 0 1 1 2 0
Output
1
Codeforces (c) C
题意:给你一堆点,问能组成多少个平行四边形。
分析:中点相等的两条不共线线段可以组成平行四边形。
#include <cstdio>
#include <iostream>
#include <utility>
#include <map>
using namespace std;
struct thing
{
int x,y;
} p[2005];
map <pair<int,int>,int> f;
int n,ans;
int main()
{
cin.sync_with_stdio(false);
cin>>n;
for(int i = 1;i <= n;i++) cin>>p[i].x>>p[i].y;
for(int i = 1;i <= n-1;i++)
for(int j = i+1;j <= n;j++)
{
ans += f[make_pair(p[i].x+p[j].x,p[i].y+p[j].y)];
f[make_pair(p[i].x+p[j].x,p[i].y+p[j].y)]++;
}
cout<<ans<<endl;
}
相关文章推荐
- 动态规划专题总结
- 【算法相关】高频词汇统计系统(二)
- 满二叉树、完全二叉树、平衡二叉树、哈夫曼树
- 数据库的锁机制
- 动态规划——problem g
- js中的forEach
- js中的forEach
- R语言-创建数据集
- Android PowerManagerService和PowerManager 源码分析
- k8s 部署
- 周易六十四卦——大畜卦
- 【Leetcode】Bitwise AND of Numbers Range
- 第四章 深入JSP技术
- hdu 5690 多种方法实现
- ubuntu下NTFS分区无法访问的问题
- tomcat端口占用问题
- 【Java基础】键盘录入Scanner类中的next()与nextLine()的问题
- CodeForces 246A. Buggy Sorting【思维】
- c++实验6-数组合并
- MVC过滤器详解