/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 320.0 KiB
#2 Wrong Answer 6ms 564.0 KiB
#3 Wrong Answer 6ms 520.0 KiB
#4 Wrong Answer 5ms 584.0 KiB
#5 Wrong Answer 5ms 564.0 KiB
#6 Accepted 5ms 580.0 KiB
#7 Accepted 5ms 576.0 KiB
#8 Accepted 5ms 516.0 KiB
#9 Wrong Answer 6ms 576.0 KiB
#10 Wrong Answer 6ms 512.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long int
#define vv vector<long long>
#define mpp map<long long,long long>
#define ss set<long long>
#define vp vector<pair<long long, long long>>
#define MOD 1000000007
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define all_v v.begin(),v.end()
#define all_a a.begin(),a.end()
#define all_n for(int i=0;i<n;i++)
void requisite(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
}
int main() {
    requisite();
    ll t;
    cin>>t;
    while (t--){
        ll a,b,c;
        cin>>a>>b>>c;
        ll s=0;
        mpp mp;
        mp[a]++;
        mp[b]++;
        mp[c]++;
        for(auto it:mp){
            if (it.second>s){
                s=it.second;
            }
        }
        if (s==3){
            cout<<0<<endl;
        }
        else if (s==2){
            cout<<1<<endl;
        }
        else{
            cout<<2<<endl;
        }
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1061 Bring equality
Contest
Brain Booster #4
Language
C++17 (G++ 13.2.0)
Submit At
2024-07-14 15:43:47
Judged At
2024-10-03 13:39:18
Judged By
Score
40
Total Time
6ms
Peak Memory
584.0 KiB