# Olympics Ranking|Codechef Coding Problems

problem statement:

In Olympics, the countries are ranked by the **total number of medals won**. You are given six integers *G*1, *S*1, *B*1, and *G*2, *S*2, *B*2

, the number of gold, silver and bronze medals won by two different counties respectively. Determine which country is ranked better on the leaderboard. It is guaranteed that there will not be a tie between the two countries.

# 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
*G*1,*S*1,*B*1, and*G*2,*S*2,*B*2

# Output Format

For each test case, print `"1"`

if the first country is ranked better or `"2"`

otherwise. Output the answer without quotes.

# Constraints

- 1≤
*T*≤1000 - 0≤
*G*1,*S*1,*B*1,*G*2,*S*2,*B*2≤30

# Subtasks

**Subtask #1 (100 points):** Original constraints

# 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

**Test case 1**

**:** Total medals for the first country are 10+20+30=60 and that for the second country are 0+29+30=59

. So the first country is ranked better than the second country.

**Test case 2**

**:** Total medals for the first country are 0+0+0=0 and that for the second country are 0+0+1=1. So the second country is ranked better than the first country.

**Code & Algorithm:**

/* author : @akash */#include<bits/stdc++.h>

using namespace std;#define ll long long int

#define pb push_back

#define mod 1000000007

#define ld long doublevoid 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)

Thank You.

**Akash Kumar**

**Software Engineer**