Codeforces Educational Codeforces Round 3 B. The Best Gift 水题
2015-12-20 03:05
609 查看
B. The Best Gift
题目连接:
http://www.codeforces.com/contest/609/problem/BDescription
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
Sample Output
5Hint
题意
一共有n本书,每本书都属于m类中的一个,然后有一个人想拿两本书走,这两本书必须来自不同类别,问你一共有多少种拿法。题解:
注意,m的数据范围只有10。所以我们只要记录每一类书有多少本就好了,然后种类就直接暴力算就好了。代码
#include<bits/stdc++.h> using namespace std; int h[15]; int main() { int n,m; scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { int x;scanf("%d",&x); h[x]++; } long long ans = 0; for(int i=1;i<=m;i++) for(int j=i+1;j<=m;j++) ans+=h[i]*h[j]; cout<<ans<<endl; }
相关文章推荐
- Codeforces Educational Codeforces Round 3 A. USB Flash Drives 水题
- 有关11n only和11bg mixed和11bgn mixed区别问题的记录
- cf595d
- WINDOWS SERVER 2016 TP4(技术预览第四版)搭建MDT 2013 UPDATE 1成功
- import TensorFlow提示Unable to load cuDNN DSO
- Linux同步时间
- iOS 中 CAShapeLayer 的使用( 等待删除的博文)
- 237. Delete Node in a Linked List
- Leetcode: Implement Queue using Stacks
- Android学习笔记(22):AdapterView与Adapter
- org.hibernate.PersistentObjectException: detached entity passed to persist:报错解决方法
- Sicily 1001. Alphacode
- Xcode出现The operation couldn’t be completed. (LaunchServicesError error 0.)错误
- Xcode出现The operation couldn’t be completed. (LaunchServicesError error 0.)错误
- Leetcode: Majority Element II
- html页面插入flash代码
- OC的description方法
- CSS3 仿古墓丽影9菜单界面
- WIKIOI--1203判断浮点数是否相等
- Codeforces Educational Codeforces Round 3 D. Gadgets for dollars and pounds(二分 + 贪心)