The best gift
来源:互联网 发布:谷歌输入法 linux 编辑:程序博客网 时间:2024/05/17 21:55
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 aren 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 andm (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, whereai (1 ≤ ai ≤ m) equals the genre of thei-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
<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>
- 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(签到)
- 自然语言处理(1)——文本分词
- 【SAP综合】BDT和XO的应用心得
- Fast R-CNN
- iOS XML,JOSN数据解析
- 【SAP UI】PBO和PAI
- The best gift
- leetcode 58、Length of Last Word;59、Spiral Matrix II ;60、Permutation Sequence
- webrtc的客户端及服务程序
- xwiki项目部署,配置文件配置
- 树莓派安装LAMP
- LARS算法的几何意义
- 【C++primer】一学期阅读笔记
- (学习笔记)MongoDB 分布式搭建 --- 副本集分片
- Jsoup的select选择器