zoukankan      html  css  js  c++  java
  • B

    Problem description

    Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera has got four horseshoes left from the last year, but maybe some of them have the same color. In this case he needs to go to the store and buy some few more horseshoes, not to lose face in front of his stylish comrades.

    Fortunately, the store sells horseshoes of all colors under the sun and Valera has enough money to buy any four of them. However, in order to save the money, he would like to spend as little money as possible, so you need to help Valera and determine what is the minimum number of horseshoes he needs to buy to wear four horseshoes of different colors to a party.

    Input

    The first line contains four space-separated integers s1, s2, s3, s4 (1 ≤ s1, s2, s3, s4 ≤ 109) — the colors of horseshoes Valera has.

    Consider all possible colors indexed with integers.

    Output

    Print a single integer — the minimum number of horseshoes Valera needs to buy.

    Examples

    Input

    1 7 3 3

    Output

    1

    Input

    7 7 7 7

    Output

    3
    解题思路:题目的意思就是将相同的数替换掉多少个数后才能使4个数都不相同,求替换掉的个数,set容器水过!
    AC代码:
    1 #include<bits/stdc++.h>
    2 using namespace std;
    3 int main(){
    4     int s;set<int> se;
    5     for(int i=1;i<=4;++i){cin>>s;se.insert(s);}
    6     cout<<4-se.size()<<endl;
    7     return 0;
    8 }
  • 相关阅读:
    前端之HTML补充
    前端之HTML
    mysql 视图,触发器,存储
    mysql 函数 事务
    索引扩展
    mysql数据库索引相关
    mysql 存储过程查询语句
    mysql 单表查询
    mysql 多表连接查询
    js引入的几种简单写法
  • 原文地址:https://www.cnblogs.com/acgoto/p/9179024.html
Copyright © 2011-2022 走看看