CodeForces 609B The Best Gift
2016-07-18 10:33
302 查看
C - The Best Gift
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice CodeForces
609B
Appoint description:
System Crawler (Jul 17, 2016 7:08:22 PM)
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
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.
题意:给出几种不同类的书,从中选两种不同类的书,问有多少种不同的方法。
刚开始弄错题意了,给出的N个数是,每本书的分类号。
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice CodeForces
609B
Appoint description:
System Crawler (Jul 17, 2016 7:08:22 PM)
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
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.
题意:给出几种不同类的书,从中选两种不同类的书,问有多少种不同的方法。
刚开始弄错题意了,给出的N个数是,每本书的分类号。
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; __int64 n,m,i,j,k,sum,num,a[15]; int main() { while(scanf("%I64d%I64d",&n,&m)!=EOF) { memset(a,0,sizeof(a)); num=0; for(i=0;i<n;i++) { scanf("%I64d",&k); a[k]++; } for(i=0;i<=11;i++) { num+=a[i]*(n-a[i]); } printf("%I64d\n",num/2); } return 0; }
相关文章推荐
- 指针的引用与指针的区别。
- IBM BigInsights新增独门绝技:全面支持Hadoop On Power!
- 当我们谈论美食的时候我们会谈论什么
- 二叉树中完全二叉树、满二叉树、二叉排序树、平衡二叉树的区别和联系
- 为ubuntu添加多媒体以及flash等等常用包
- python脚本实现自动登陆校园网
- @autowired和@Resource
- VC如何让窗口半透明
- DFS生成n个数的排列数
- System.InvalidOperationException
- 魔都 3 年,从程序员到 CTO
- CSS 多类选择器
- 阿里云服务器mysql数据库修改密码
- 利用颜色和形态学两种方法进行车牌区域提取的OpenCV代码
- HDU 1106
- 安卓学习笔记---使用AndroidStudio出现的问题错误(错误: -source 1.6 中不支持 diamond 运算符 (请使用 -source 7 或更高版本以启用 diamond 运算)
- rand、srand生成随机数
- caffe源码阅读2-syncedmem.hpp+.cpp
- android添加ssh(openssh)
- 有向图的强连通性