Blitz : BLICZ | CodeChef Solution

Problem

In a Chess match "a + b", each player has a clock which shows a minutes at the start and whenever a player makes a move, b seconds are added to this player's clock. Time on a player's clock decreases during that player's turns and remains unchanged during the other player's turns. If the time on some player's clock hits zero (but not only in this case), this player loses the game.

There's a 3 + 2 blitz chess match. After NN turns (i.e. \left\lfloor \frac{N+1}{2} \right\rfloor⌊2N+1⌋ moves made by white and \left\lfloor \frac{N}{2} \right\rfloor⌊2N⌋ moves made by black), the game ends and the clocks of the two players stop; they show that the players (white and black) have A and B seconds left respectively. Note that after the N-th turn, b = 2 seconds are still added to the clock of the player that made the last move and then the game ends.

Find the total duration of the game.

All Weeks CodeChef Solution | Please Share With Your friends 😉😊

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 three space-separated integers N, A and B..

Output Format

For each test case, print a single line containing one integer — the duration of the game.

Constraints

Sample

Input

10 0 2

11 2 1

12 192 192

Output

378

379

Explanation

Example case 1: The total time given to both clocks after 1010 turns is 2 \cdot (180 + 10) = 3802⋅(180+10)=380 seconds. The total time left at the end is 0 + 2 = 20+2=2 seconds. The duration of the game is 380 - 2 = 378380−2=378 seconds.

Example case 3: The total time given to both clocks after 1212 turns is 2 \cdot (180 + 12) = 3842⋅(180+12)=384 seconds. The total time left at the end is 192 + 192 = 384192+192=384 seconds. The duration of the game is 384 - 384 = 0384−384=0 seconds..

Solution


        cpp
        
            
        
     
#include <iostream>
using namespace std;

// Solution from : Code Radius [ https://radiuscode.blogspot.com/ ]

int main() {
 int t,x,y;
	cin>>t;
	for(int i=0;i<t;i++)
	{
	    int a,b,c;
	    cin>>a>>b>>c;
	    x=2*(180+a);
	    y=b+c;
	    cout<<(x-y)<<endl;
	    
	}
 return 0;
}


        java
        
            
        
     
import java.util.*;
class Codechef
{
	public static void main (String[] args) 
	{
		Scanner input =new Scanner(System.in);
	
		int t= input.nextInt();
	
		while(t-->0){
			int N= input.nextInt();
			int a= input.nextInt();
			int b= input.nextInt();
    			System.out.println((2*(180+N))-(a+b));
		}
	}
}


        python
        
            
        
     
test=int(input())
for j in range(test):
    a,b,c=input().split()
    a,b,c=int(a),int(b),int(c)
    print(2*(180+a)-(b+c))

Please First Try to Solve Problem by Yourself.

Code Radius

Blitz : BLICZ | CodeChef Solution

Problem

Input Format

Output Format

Constraints

Sample

Explanation

Solution

You may like these posts

Post a Comment

Sum of Digits : FLOW006 | CodeChef Solution

Correct Slippers : CORRSLP | CodeChef Solution

Area OR Perimeter : AREAPERI | CodeChef Solution

Summer Heat : COCONUT | CodeChef Solution

Coldplay : SLOOP | CodeChef Solution