The Best Gift
来源:互联网 发布:上海房价 知乎 编辑:程序博客网 时间:2024/05/21 10:53
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.
题目大意:一个人去买书,第一个数据告诉你有多少本书,第二个告诉你有多少类,接下来一行是每一本书的类。
题目链接:http://codeforces.com/problemset/problem/609/B
源代码:
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;int ans=0;int main(){ int i,j; int n,m,x,h[11]={0}; scanf("%d%d",&n,&m); for(i=0;i<n;i++) { scanf("%d",&x); h[x]++; } for(i=1;i<10;i++) { for(j=i+1;j<11;j++) { ans=ans+h[i]*h[j]; } } printf("%d\n",ans); 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(签到)
- 从一位道家大师流传出来的秘密…… 最好都背下来!
- iOS NSPredicate 模糊、精确、查询
- Intellij Idea中运行tomcat 报內存溢出 PermGen space 解决方案
- 配置pch文件
- #define用法
- The Best Gift
- 安卓开发:ListView简单入门
- mysql 排序规则
- Java网络连接之HttpURLConnection与HttpClient 区别及联系
- 如何用70行Java代码实现神经网络算法
- 手机浏览器中打开微信
- hdu 2074 叠框
- Android 抖动效果
- js-jQuery对象与dom对象相互转换