The Best Gift
来源:互联网 发布:搜狐影音for mac 编辑:程序博客网 时间:2024/04/30 07:07
Description
Emily's birthday is next week and Jack has decided to buy a present for her. He knows she loves books so he goes to the local bookshop, where there are n books on sale from one of m genres.
In the bookshop, Jack decides to buy two books of different genres.
Based on the genre of books on sale in the shop, find the number of options available to Jack for choosing two books of different genres for Emily. Options are considered different if they differ in at least one book.
The books are given by indices of their genres. The genres are numbered from 1 to m.
Input
The first line contains two positive integers n and m (2 ≤ n ≤ 2·105, 2 ≤ m ≤ 10) — the number of books in the bookstore and the number of genres.
The second line contains a sequence a1, a2, ..., an, where ai (1 ≤ ai ≤ m) equals the genre of the i-th book.
It is guaranteed that for each genre there is at least one book of that genre.
Output
Print the only integer — the number of ways in which Jack can choose books.
It is guaranteed that the answer doesn't exceed the value 2·109.
Sample Input
4 32 1 3 1
5
7 44 2 3 1 2 4 3
18
Hint
The answer to the first test sample equals 5 as Sasha can choose:
- the first and second books,
- the first and third books,
- the first and fourth books,
- the second and third books,
- the third and fourth books.
#include<cstring>
#include<cstdio>
using namespace std;
int a[200010];
int main()
{
long n;
int m;
scanf("%ld%d",&n,&m);
long long sum=0;
int num;
memset(a,0,sizeof(a));
for(long i=1;i<=n;i++)
{
cin>>num;
sum+=i-1-a[num];//与之前的书都能满足条件;
a[num]++;//书的种类加加;
}
printf("%lld\n",sum);
return 0;
}
- The best gift
- The Best Gift
- The Best Gift
- codeforces_609B. The Best Gift
- The Best Gift
- Codeforces 609B The Best Gift 【水题】
- CodeForces 609B The Best Gift
- CodeForces 609B.The Best Gift
- CodeForces 609B The Best Gift
- CF 609B The Best Gift
- CodeForces 609B The Best Gift
- Educational Codeforces Round 3 B. The Best Gift
- CodeForcess--609B--The Best Gift(模拟水题)
- ♥CodeForces 609B-B. The Best Gift【组合数学】
- 【CodeForces】609B - The Best Gift(水)
- Educational Codeforces Round 3 B.The Best Gift (数学)
- CodeForces 609 B. The Best Gift(水~)
- Codeforces Educational Codeforces Round 3 B. The Best Gift(签到)
- UniversalImageLoader实现无图模式
- 给UIButton里面的文本文字加shadow
- 二叉树恢复
- 码农周刊分类整理
- 文章标题
- The Best Gift
- Android Audio架构
- Java语法糖1:可变长度参数以及foreach循环原理
- android 将小图片平铺显示的做法
- iOS 开发常用宏
- C++调用java方法——这样也可以?
- java程序员成长之路——转
- hihocoder1143 骨牌覆盖问题·一(矩阵快速幂)
- 自定义NSOperation