Skip to main content

Covid Run Codechef October long challenge problem solution| Codechef October long challenge problem solution

Covid Run Codechef October long  challenge problem solution| Codechef October long  challenge problem solution -

This is very first and easy problem of Codechef October long  challenge problem solution| Codechef October long  challenge problem solution.

Problem Statement-

Covid-19 is spreading fast! There are N cities, numbered from 0 to (N1), arranged in a circular manner. City 0 is connected to city 11 to 2, city (N2) to city (N1), and city (N1) to city 0.

The virus is currently at city X. Each day, it jumps from its current city, to the city K to its right, i.e., from city X to the city (X+K)%N. As the virus jumps, the cities in between don't get infected. Cities once infected stay infected. You live in city YFind if it will reach your city eventually. If it will, print YES, else print NO.


  • The first line of the input consists of an integer T, the number of test cases.
  • The first and only line of each test case contains four space-separated integers - NKX and Y, denoting the number of cities, the size of jumps, Covid's current city, and the city that you live in, respectively.


For each test case, in a new line, print YES if Covid shall reach your city after a finite number of days, else print NO.


  • 1T100
  • 1N1000
  • 0X,YN1
  • 0K1000


  • Subtask 1 - 100% - Original constraints

Sample Input:

6 2 5 3
12 3 4 2

Sample Output:



  • In the first sample, Covid starts at city 5, then goes to city 1, and then from city 1 to city 3. Thus, it reaches the city that you live in.

  • In the second sample, Covid starts at city 4, goes to city 7, then 101, then 4710, and so on. It never reaches city 2.

Let's directly jump into solution 
according to problem statement take input t= total number of test cases .
next line contain n,k,xand y
take input for n,k,x and y.
virus is currently at city x.
spreading rate of virus is k means virus can jump k city from its currenty position x.
Question says that you are living currently at y city so you have to tell that virus may infect you or not.

Approach of this question is very simple simply you have to jump k step from current city and if this goes out of (N-1) city  it will 
return back to city (n+k)%n th city.

dont try to think too much follow steps as mentioned in question it is called bruete force approach.

My approach-

My approach says that if the virus currently at city x in the next step it will jump to (x+k)%n th city.
What i will do i will maintain a  flag variable that will tell me that virus can reach to place y or not.

step 1-If virus already at position y. so i have to simply return true.otherwise, I will move form current city to x+k th this case i will mark my flag as true and terminate the loop.
step 2- if virus reach again at x position it mean it will never reach to city y and the person who is sitting in city y is safe.
in this case i will mark my flag as false and terminate the loop.

finally, i will print the result according to the flag


Entire code solution is given below-


Popular posts from this blog

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- 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