The Best Gift
来源:互联网 发布:mac os 五笔输入法 编辑:程序博客网 时间:2024/05/18 02:15
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
Sample Output
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<cstdio>#include<cmath>#include<cstring>#include<cstdlib>using namespace std;int main(){ int n, m, i, j, s = 0, x = 0; int a[11] = {0}; scanf("%d%d", &n, &m); for (i = 0; i < n; i++) { int t; scanf("%d", &t); a[t]++; } for (i = 0; i < 11; i++) { for (j = i + 1; j < 11; j++) { s += a[i] * a[j]; } } printf("%d\n", s); 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(签到)
- 【BZOJ2242】【SDOI2011】计算器(快速幂+扩欧+BSGS)
- java操作 oracle 的 blob和clob类型
- linux下安装jdk并配置环境变量
- 网络应用的架构风格
- svmtrain和svmpredict简介
- The Best Gift
- JNI编程中如何传递参数和返回值
- 阿里云服务器Web项目配置发布全过程(二)
- 喝汽水问题
- QPS 与 TPS 简介
- 用队列打印杨辉三角
- 改变网络接口速度和协商方式miitool和ethtool
- 消除绝对定位的影响
- 文件上传和下载(二)--【struts2】