Codeforces Round #799 (Div. 4) 1692A. Marathon Solution

                  

Problem Link: https://codeforces.com/contest/1692/problem/A

 Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

///**********ALLAH IS ALMIGHTY************///

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int x,t,i,j,o,e,n;

    cin>>t;

    while(t--)

    {

        int a[9];

        for(i=1; i<=4; i++)

        {

            cin>>a[i];

            if(i==1)

                x=a[i];

        }

        sort(a+1,a+4+1);

        for(i=1; i<=4; i++)

        {

            if(x==a[i])

            {

                n=i;

                break;

            }

        }

        if(n==4)

            cout<<"0"<<endl;

        else if(n==3)

            cout<<"1"<<endl;

        else if(n==2)

            cout<<"2"<<endl;

        else if(n==1)

            cout<<"3"<<endl;

    }

}