Olympics Ranking|Codechef Coding Problems

Input Format

  • The first line of the input contains a single integer T
  • denoting the number of test cases. The description of T
  • test cases follows.
  • The first and only line of each test case contains six space-separated integers G1, S1, B1, and G2, S2, B2

Output Format

Constraints

  • 1≤T≤1000
  • 0≤G1,S1,B1,G2,S2,B2≤30

Subtasks

Sample Input 1

3
10 20 30 0 29 30
0 0 0 0 0 1
1 1 1 0 0 0

Sample Output 1

1
2
1

Explanation

/* author : @akash */#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mod 1000000007
#define ld long double
void solve()
{
int G1,S1,B1;
int G2,S2,B2;
cin>>G1>>S1>>B1>>G2>>S2>>B2;
if(G1+S1+B1>G2+S2+B2)
{
cout<<1;
}
else
{
cout<<2;
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--)
{
solve();
cout<<"\n";
}
return 0;
}
// time complexity of this algorithm is : T(n)=O(1)

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Akash Kumar

Akash Kumar

Student of Computer Science & Engineering at Moradabad Institute of Technology.