## Point Of Impact Codechef January 2021 solution || Point Of Impact codechef january 2021 editorial -

### Problem statement-

You are playing a Billiards-like game on an $N×N$ table, which has its four corners at the points $\left\{\left(0,0\right),\left(0,N\right),\left(N,0\right),$ and $\left(N,N\right)\right\}$. You start from a coordinate $\left(x,y\right)$$\left(0 and shoot the ball at an angle ${45}^{\circ }$ with the horizontal. On hitting the sides, the ball continues to move with the same velocity and ensuring that the angle of incidence is equal to the angle of reflection with the normal, i.e, it is reflected with zero frictional loss. On hitting either of the four corners, the ball stops there and doesn’t move any further.

Find the coordinates of the point of collision, when the ball hits the sides for the ${K}^{th}$ time. If the ball stops before hitting the sides $K$ times, find the coordinates of the corner point where the ball stopped instead.

### Input:

• The first line of the input contains an integer $T$, the number of testcases.
• Each testcase contains a single line of input, which has four space separated integers - $N$$K$$x$$y$, denoting the size of the board, the number of collisions to report the answer for, and the starting coordinates.

### Output:

For each testcase, print the coordinates of the ball when it hits the sides for the ${K}^{th}$ time, or the coordinates of the corner point if it stopped earlier.

### Constraints

• $1\le T\le {10}^{5}$
• $2\le N\le {10}^{9}$
• $1\le K\le {10}^{9}$

• $30$ points : Sum of $K$ over all test cases $\le {10}^{7}$
• $70$ points : Original constraints.

### Sample Input:

2
5 5 4 4
5 2 3 1


### Sample Output:

5 5
3 5


### Explanation:

• Sample Case $1$ :

We are given a $5$ by $5$ board. We shoot the ball from coordinates $\left(4,4\right)$, and we need to find its coordinates after it has collided with sides $5$ times. However, after shooting, the ball goes directly to the corner $\left(5,5\right)$, and stops there. So we report the coordinates $\left(5,5\right)$.

• Sample Case $2$ :

We are given a $5$ by $5$ board. We shoot the ball from the coordinates $\left(3,1\right)$, and we need to find its coordinates after it has collided with the sides twice. After shooting, it first hits the right side at $\left(5,3\right)$, and then the top side at $\left(3,5\right)$. So, we report $\left(3,5\right)$.

Solution -

Actually this is a simple problem you need little bit of maths knowledge to solve this problem.
You have to find 4 points on where the ball is striking. the fact is that the ball can strike a maximum of 4 different point and after first 4 point  point of impact will start repeating.

You need to find 4 points of impact and ball direction(clockwise / anticlockwise) .ans differ according to ball direction.
Here is my code. look it and check how i implemented this logic.

Join telegram channel for code and editorial.-https://t.me/competitiveProgrammingDiscussion

### Vaccine Distribution Codechef December Long challenge solution 2020

Vaccine Distribution  Codechef December Long challenge solution 2020- This Problem vaccine distribution is taken from December long challenge 2020. lets read problem statement. Problem statement- Finally, a COVID vaccine is out on the market and the Chefland government has asked you to form a plan to distribute it to the public as soon as possible. There are a total of  N N  people with ages  a 1 , a 2 , … , a N a 1 , a 2 , … , a N . There is only one hospital where vaccination is done and it is only possible to vaccinate up to  D D  people per day. Anyone whose age is  ≥ 80 ≥ 80  or  ≤ 9 ≤ 9  is considered to be  at risk . On each day, you may not vaccinate both a person who is at risk and a person who is not at risk. Find the smallest number of days needed to vaccinate everyone. Input The first line of the input contains a single integer  T T  denoting the number of test cases. The description of  T T  test cases follows. The first line of each test case contains two space-separ

### Codechef February long challenge solution 2021

Codechef February  long challenge solution 2021- Hey guys Welcome Again, A small update CodeChef February  long challenge solution 2021 starting from 1st week of beb  2021 . Codechef long challenge is one of the popular contests of CodeChef you should participate in codechef Feb  long challenge.This is first contest of codechef in 2021 so good luck. And wish you happy new year. Contest link- https://www.codechef.com/FEB21/?itm_medium=navmenu&itm_campaign=FEB21 I will post the solution after Contest.Stay tuned. About CodeChef  February  long challenge solution 2021: CodeChef Long Challenge is a 10-day monthly coding contest where you can show off your computer programming skills. The significance being - it gives you enough time to think about a problem, try different ways of attacking the problem, read the concepts etc. If you’re usually slow at solving problems and have ample time at hand, this is ideal for you. We also put in a lot of efforts in getting quality problems, w

### Merge Two sorted array Without Extra Space

Problem statement-  Given two sorted arrays arr1[] and arr2[] of sizes N and M in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.    Example 1: Input:  N = 4, arr1[] = [1 3 5 7]  M = 5, arr2[] = [0 2 6 8 9] Output:  arr1[] = [0 1 2 3] arr2[] = [5 6 7 8 9] Explanation: After merging the two  non-decreasing arrays, we get,  0 1 2 3 5 6 7 8 9.   Example 2: Input:  N = 2, arr1[] = [10, 12]  M = 3, arr2[] = [5 18 20] Output:  arr1[] = [5 10] arr2[] = [12 18 20] Explanation: After merging two sorted arrays  we get 5 10 12 18 20. Your Task: You don't need to read input or print anything. You only need to complete the function merge() that takes arr1, arr2, N and M as input parameters and modifies them in-place so that they look like the sorted merged array when concatenated. Expected Time Complexity:  O((n+m) log(n+m)) Expected Auxilliary Space: O(1