zoukankan      html  css  js  c++  java
  • CodeForcess--609B--The Best Gift(模拟水题)

    Time Limit: 2000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u

    Status

    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
    

    Sample Output

    Hint

    The answer to the first test sample equals 5 as Sasha can choose:

    1. the first and second books,
    2. the first and third books,
    3. the first and fourth books,
    4. the second and third books,
    5. the third and fourth books.

    Source


    给了m种书,每种有若干本,让你计算一下挑出两本不一样的方案,
    #include<stdio.h>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    int vis[20],m,n;
    long long ans;
    int main()
    {
    	while(scanf("%d%d",&n,&m)!=EOF)
    	{
    		 ans=0;
    		 int a;
    		 memset(vis,0,sizeof(vis));
    		 for(int i=0;i<n;i++)
    		 {
    		 	scanf("%d",&a);
    		 	vis[a]++;
    		 }
    		 for(int i=1;i<=10;i++)
    		 {
    		 	ans+=vis[i]*(n-vis[i]);
    		 }
    		 printf("%lld
    ",ans/2);
    	}
    	return 0;
    }


  • 相关阅读:
    前端网站汇总
    更换Sublime Text主题字体
    免费收录网站搜索引擎登录口
    IE6,7,8支持css圆角
    CSS继承—深入剖析
    JavaScript正则表达式大全
    CSS伪元素选择器
    line-height用法总结
    判断腾讯QQ是否在线
    text-overflow使用文字超多div的宽度或超过在table中<td>
  • 原文地址:https://www.cnblogs.com/playboy307/p/5273523.html
Copyright © 2011-2022 走看看