Problem Description

The problem solvers have found a new Island for coding and named it as Philaland.

These smart people were given a task to make purchase of items at the Island easier by distributing various
coins with different value.

Manish has come up with a solution that if we make coins category starting from $1 till the maximum
price of item present on Island, then we can purchase any item easily. He added following example to
prove his point.

Lets suppose the maximum price of an item is 5$ then we can make coins of {$1, $2, $3, $4, $5} to
purchase any item ranging from $1 till $5.

Now Manisha, being a keen observer suggested that we could actually minimize the number of coins
required and gave following distribution {$1, $2, $3}. According to him any item can be purchased one
time ranging from $1 to $5. Everyone was impressed with both of them.

Your task is to help Manisha come up with minimum number of denominations for any arbitrary max price
in Philaland.

Constraints
1<=T<=100

1<=N<=5000

Input Format
First line contains an integer T denoting the number of test cases.

Next T lines contains an integer N denoting the maximum price of the item present on Philaland.

Output
For each test case print a single line denoting the minimum number of denominations of coins required.

Timeout
1

Test Case
Example 1

Input

10

Output
4

Explanation

For test case 1, N=10.

According to Manish {$1, $2, $3,... $10} must be distributed.

But as per Manisha only {$1, $2, $3, $4} coins are enough to purchase any item ranging from $1 to $10.
Hence minimum is 4. Likewise denominations could also be {$1, $2, $3, $5}. Hence answer is still 4.

For test case 2, N=5.

According to Manish {$1, $2, $3, $4, $5} must be distributed.

But as per Manisha only {$1, $2, $3} coins are enough to purchase any item ranging from $1 to $5. Hence
minimum is 3. Likewise denominations could also be {$1, $2, $4}. Hence answer is still 3.

Prime Fibonnaci
Problem Description
Given two numbers n1 and n2

1. Find prime numbers between n1 and n2, then

2. Make all possible unique combinations of numbers from the prime numbers list you found in step 1. 

3. From this new list, again find all prime numbers.

4. Find smallest (a) and largest (b) number from the 2nd generated list, also count of this list.

5. Consider smallest and largest number as the 1st and 2nd number to generate Fibonacci series
respectively till the count (number of primes in the 2nd list).

6. Print the last number of a Fibonacci series as an output

Constraints
2 <= n1, n2 <= 100

n2 - n1 >= 35

Input Format
One line containing two space separated integers n1 and n2.

Output
Last number of a generated Fibonacci series.
Timeout
1

Test Case
Example 1

Input

2 40

Output

13158006689

Explanation

1st prime list = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]

Combination of all the primes = [23, 25, 27, 211, 213, 217, 219, 223, 229, 231, 32, 35, 37, 311, 313, 319,
323, 329, 331, 337, 52, 53, 57, 511, 513, 517, 519, 523, 529, 531, 537, 72, 73, 75, 711, 713, 717, 719, 723,
729, 731, 737, 112, 113, 115, 117, 1113, 1117, 1119, 1123, 1129, 1131, 1137, 132, 133, 135, 137, 1311,
1317, 1319, 1323, 1329, 1331, 1337, 172, 173, 175, 177, 1711, 1713, 1719, 1723, 1729, 1731, 1737, 192,
193, 195, 197, 1911, 1913, 1917, 1923, 1929, 1931, 1937, 232, 233, 235, 237, 2311, 2313, 2317, 2319,
2329, 2331, 2337, 292, 293, 295, 297, 2911, 2913, 2917, 2919, 2923, 2931, 2937, 312, 315, 317, 3111,
3113, 3117, 3119, 3123, 3129, 3137, 372, 373, 375, 377, 3711, 3713, 3717, 3719, 3723, 3729, 3731]

2nd prime list=[193, 3137, 197, 2311, 3719, 73, 137, 331, 523, 1931, 719, 337, 211, 23, 1117, 223, 1123,
229, 37, 293, 2917, 1319, 1129, 233, 173, 3119, 113, 53, 373, 311, 313, 1913, 1723, 317]

smallest (a) = 23

largest (b) = 3719

Therefore, the last number of a Fibonacci series i.e. 34th Fibonacci number in the series that has 23 and
3719 as the first 2 numbers is 13158006689

Example 2

Input

30 70

Output

2027041 

Explanation

1st prime list=[31, 37, 41, 43, 47, 53, 59, 61, 67]

2nd prime list generated form combination of 1st prime list = [3137, 5953, 5347, 6761, 3761, 4337, 6737,
6131, 3767, 4759, 4153, 3167, 4159, 6143]

smallest prime in 2nd list=3137

Collision Course
Problem Description
On a busy road, multiple cars are passing by. A simulation is run to see what happens if brakes fail for all
cars on the road. The only way for them to be safe is if they don't collide and pass by each other. The goal
is to identify whether any of the given cars would collide or pass by each other safely around a
Roundabout. Think of this as a reference point O ( Origin with coordinates (0,0) ), but instead of going
around it, cars pass through it.

Considering that each car is moving in a straight line towards the origin with individual uniform speed.
Cars will continue to travel in that same straight line even after crossing origin. Calculate the number of
collisions that will happen in such a scenario.

Note : - Calculate collisions only at origin. Ignore the other collisions. Assume that each car continues on
its respective path even after the collision without change of direction or speed for an infinite distance.

Constraints
1<=C<=10^5

-10^9 <= x,y <= 10^9

0 < v < 10^9.

Input Format
The first line contains an integer C, denoting the number of cars being considered that are passing by
around the origin.

Next C lines contain 3 space delimited values, first two of them being for position coordinates (x,y) in 2D
space and the third one for speed (v).

Output
A single integer Q denoting the number of collisions at origin possible for given set of cars.

Timeout
1

Test Case
Example 1

Input

5 12 1
16 63 5

-10 24 2

7 24 2

-24 7 2

Output

Explanation

Let the 5 cars be A, B, C, D, and E respectively.

4 Collisions are as follows -

1) A & B.

2) A & C.

3) B & C.

4) D & E.

Television Sets
Problem Description
Dr. Vishnu is opening a new world class hospital in a small town designed to be the first preference of the
patients in the city. Hospital has N rooms of two types - with TV and without TV, with daily rates of R1
and R2 respectively. 

However, from his experience Dr. Vishnu knows that the number of patients is not constant throughout the
year, instead it follows a pattern. The number of patients on any given day of the year is given by the
following formula – 

(6-M)^2 + |D-15| where
M is the number of month (1 for jan, 2 for feb ...12 for dec) and
D is the date (1,2...31).
All patients prefer without TV rooms as they are cheaper, but will opt for with TV rooms only if without
TV rooms are not available. Hospital has a revenue target for the first year of operation. Given this target
and the values of N, R1 and R2 you need to identify the number of TVs the hospital should buy so that it
meets the revenue target. Assume the Hospital opens on 1st Jan and year is a non-leap year. 
Constraints
Hospital opens on 1st Jan in an ordinary year

5 <= Number of rooms <= 100

500 <= Room Rates <= 5000

0 <= Target revenue < 90000000

Input Format
First line provides an integer N that denotes the number of rooms in the hospital

Second line provides two space-delimited integers that denote the rates of rooms with TV (R1) and without
TV (R2) respectively

Third line provides the revenue target

Output
Minimum number of TVs the hospital needs to buy to meet its revenue target. If it cannot achieve its
target, print the total number of rooms in the hospital.

Timeout
1

Test Case
Example 1

Input

20

1500 1000

7000000

Output

14 

Explanation

Using the formula, number of patients on 1st Jan will be 39, on 2nd Jan will be 38 and so on. Considering
there are only twenty rooms and rates of both type of rooms are 1500 and 1000 respectively, we will need
14 TV sets to get revenue of 7119500. With 13 TV sets Total revenue will be less than 7000000

Example 2

Input

10

1000 1500

10000000

Output

10

Explanation

In the above example, the target will not be achieved, even by equipping all the rooms with TV. Hence, the
answer is 10 i.e. total number of rooms in the hospital.
Lazy Student
Problem Description
There is a test of Algorithms. Teacher provides a question bank consisting of N questions and guarantees
all the questions in the test will be from this question bank. Due to lack of time and his laziness, Codu
could only practice M questions. There are T questions in a question paper selected randomly. Passing
criteria is solving at least 1 of the T problems. Codu can't solve the question he didn't practice. What is the
probability that Codu will pass the test?
Constraints
0 < T <= 10000

0 < N, T <= 1000

0 <= M <= 1000

M,T <= N

Input Format
First line contains single integer T denoting the number of test cases.

First line of each test case contains 3 integers separated by space denoting N, T, and M.

Output
For each test case, print a single integer.

If probability is p/q where p & q are co-prime, print (p*mulInv(q)) modulo 1000000007, where mulInv(x)
is multiplicative inverse of x under modulo 1000000007.

Timeout
1

Test Case
Example 1

Input

421

Output

500000004

Explanation

The probability is ½. So output is 500000004.

He suddenly notices a person who is drowning and springs to action.

He runs up to the sea with a speed f*V km/hr, then he swims straight to the person at the rate V km/hr
(both in straight lines and where f is a multiplying factor as humans run much faster than they can swim).

He wants to minimize the time taken to get to that person.

See the below image for better understanding :

Since the lifeguard runs faster, it will save some more time to run a longer distance rather than going
straight and thus swimming a long distance.

However, this comes with the trade-off that running longer can actually mean going a longer distance thus
taking more time.

Thus, it can be logically inferred that, there must exist a spot on the Beach-Sea Interface where, if the
lifeguard directly runs to from his starting location, and then swims directly to the drowning person, it'll
take the least time.

Given the starting location , the location of the drowning person and the multiplying factor f, find the
optimized spot for fastest time.

Assumptions/Problem Explanation:

1. Consider that everything is in a two dimensional (2D) plane.

The x axis represents the Beach-Sea interface, positive Y axis is towards land and negative Y-axis towards
sea (See image above).

2. The Y-axis along with origin is at some arbitrary location to the left of both the lifeguard and the
drowning person. Since the origin point remains the same for both of them and the staring locations are
given relative to the origin , its actual location does not matter. The only thing to note is, the origin and Y
axis is to the left of both of them, so beach is always in 1st quadrant and sea in 4th. Thus, the positions of
lifeguard and the drowning person are given as their (x,y) co-ordinates. (7,5) means the person is 7 units on
the axis and 5 units on the positive y axis, and hence on the beach. Similarly, (7,-5) means the person is 7
units on the axis and 5 units on the negative Y axis, and hence in sea.

3. The lifeguard both runs and swims in perfectly straight lines.

4. With regards to everything explained above, your task is to find a point on the Beach-Sea Interface (X
-axis) (x_optimized,0) to where if the lifeguard runs directly from his starting position and then swims
directly from the point to the drowning person, it'll take the least amount of time.

5. All calculations must be done upto 6 decimal points accuracy and the output must be upto 6 decimal
points as well.

Constraints
0 <= x_l < 100 (Integer)

0 <= y_l < 100 (Integer)

0 <= x_w < 100 (Integer)

-500 < y_w < 0 (Integer)

1 < f <= 15 (Integer)

Input Format
The input shall consist of 3 parameters :

1. Starting position of the lifeguard in terms of his coordinates (x_l,y_l).

2. Position of the drowning person (x_w,y_w)

3. The multiplying factor f.

These parameters would be given in the following order in 5 different lines:

x_l

y_l

x_w

y_w

Output
Output must be a single number, x_optimized, as described above. The output must be having accuracy to
6 decimal places. That is, 1 should be represented as 1.000000
Timeout
1
Test Case
Example 1

Input

-1

1.2

Output

1.000000