The best gift
2016-01-13 21:58
176 查看
D - The Best Gift
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
SubmitStatusPracticeCodeForces
609B
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
Input
Output
Input
Output
Hint
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
SubmitStatusPracticeCodeForces
609B
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
Input
4 3 2 1 3 1
Output
5
Input
7 4 4 2 3 1 2 4 3
Output
18
Hint
<span style="font-size:24px;">#include<stdio.h> #include<string.h> int main() { int n,m,i,t; int a[11]; long long s; s=0; scanf("%d %d",&n,&m); memset(a,0,sizeof(a)); for(i=1;i<=n;i++) { scanf("%d",&t); a[t]++; } for(i=1;i<=m;i++) { s+=a[i]*(n-a[i]); } s/=2; printf("%lld",s); return 0; }</span>
相关文章推荐
- 条件过滤
- iOS XML,JOSN数据解析
- 【SAP UI】PBO和PAI
- 列处理——列间运算
- Fast R-CNN
- 自然语言处理(1)——文本分词
- H2O是开源基于大数据的机器学习库包
- 【SAP综合】BDT和XO的应用心得
- activate-power-mode 写代码的时候体验狂拽酷炫的效果 (IDEA版安装过程及问题)
- Git版本控制器的基本使用
- H2O是开源基于大数据的机器学习库包
- MySQL 中 EXISTS 的用法
- xwiki操作手册
- 【MySql】ERROR 1045 (28000): Access denied for user 'ambari'@'localhost' (using password: YES)
- 用R建立岭回归和lasso回归
- UITabelView图片加 label 显示
- Opensource开源精神
- Linux中RPM包管理
- 【MYSQL】修改密码
- Leetcode230: Power of Three