/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 332.0 KiB
#2 Wrong Answer 29ms 560.0 KiB
#3 Wrong Answer 30ms 552.0 KiB
#4 Wrong Answer 28ms 544.0 KiB
#5 Wrong Answer 26ms 556.0 KiB
#6 Accepted 29ms 556.0 KiB
#7 Accepted 29ms 548.0 KiB
#8 Accepted 26ms 552.0 KiB
#9 Wrong Answer 29ms 552.0 KiB
#10 Wrong Answer 28ms 552.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        vector<int> v(3);
    for (int i = 0; i < 3; i++)
    {
        cin >> v[i];
    }
    sort(v.begin(), v.end());
    int leftDif = v[1] - v[0];
    int RightDif = v[2] - v[1];
    int op = 0;
    if (leftDif > 0 && RightDif > 0)
    {
        op = 2;
    }
    else if (leftDif > 0)
    {
        op = 1;
    }
    else if (RightDif > 0)
    {
        op = 1;
    }
    cout << op << endl;
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1061 Bring equality
Contest
Brain Booster #4
Language
C++20 (G++ 13.2.0)
Submit At
2024-07-14 16:39:37
Judged At
2024-10-03 13:37:16
Judged By
Score
40
Total Time
30ms
Peak Memory
560.0 KiB