how to test the case with 5 combination and inputs

1615

What is preg_match?

544

What is time invariant system?

696

Tell me what is distance vector routing protocols?

455

How do I install windows live mail on windows 10?

406

What is order of B+tree?

664

How do you use compareto?

554

Which statistic indicates how often a click has led to a conversion?

5

What is sod risk management?

344

Why mobile phone has digit numbers?

638

What is the meaning of refinance?

642

Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit

1794

How do I change my local disk?

527

Explain how routing works?

162

A set of N billiard balls are set on a one-dimensional table. The table is 1 meter long, set north-south with two pockets at either side. Each ball has zero width and there is no friction so it is moving with a fixed velocity of either northward or southward and bounces back in a perfect elastic collision from other balls it encounter on its way (or drop into one of the pockets). Your job is to keep track of the balls movements. Task Please write a program that gets the initial place, speed and direction of all the balls and gives the position of a specific ball after t seconds. Input The first line contains the number of scenarios. Each one of the other lines in the input contains a scenario: The first number, N, is the number of balls; followed by N pairs of numbers: the distance in centimeters from the south end of the table and the speed (positive speed meaning it moves northward); the last two numbers are the number i of the target ball you should track and the time T in seconds. Output The output is a single number for each line which is the place (distance in centimeters from the south end of the table) of the tracked ball after T seconds. Note: There is no new line character at the end of the result. Sample Input 5 1 50 1 1 1000 1 50 1 1 6 1 60 -2 1 6 2 10 1 95 -1 2 30 2 10 1 95 -1 2 60 Sample Output 100 56 48 65 70

2137