top of page
Click here to go to the home page of AskTheCode.

Golf CodeChef Solution - AskTheCode

Team ATC

Updated: Jun 14, 2021

CodeChef May Long Challenge Solution | Golf (LKDNGOLF) solution | AskTheCode

 

Problem:

It's a lockdown. You’re bored in your house and are playing golf in the hallway.

The hallway has N+2 tiles numbered from 0 to N+1 from left to right. There is a hole on tile number x. You hit the ball standing on tile 0. When you hit the ball, it bounces at lengths of k, i.e. the tiles covered by it are 0,k,2k,…, and so on until the ball passes tile N+1.


If the ball doesn't enter the hole in the first trial, you try again but this time standing on the tile N+1. When you hit the ball, it bounces at lengths of k, i.e. the tiles covered by it are (N+1),(N+1−k),(N+1−2k),…, and so on until the ball passes tile 0.

Find if the ball will enter the hole, either in its forward journey or backward journey.


Note: The input and output of this problem are large, so prefer using fast input/output methods.

 

Input:

  • The first line contains an integer T, the number of test cases. Then the test cases follow.

  • The only line of each test case contains three integers N,x,k.

 

Output:

Output in a single line, the answer, which should be "YES" if the ball enters the hole either in the forward or backward journey and "NO" if not.

You may print each character of the string in uppercase or lowercase (for example, the strings "yEs", "yes", "Yes" and "YES" will all be treated as identical).

 

Sample Input:

3
5 4 2
5 3 2
5 5 2
 

Sample Output:

YES
NO
NO
 

Explanation:

In each test case, the tiles covered by the ball for N=5 and k=2 are {0,2,4,6} in the forward journey and {6,4,2,0} in the backward journey.


Therefore, the answer for the first test case is "YES" since the ball falls in the position of the hole at tile 4. But the answer for test cases 2 and 3 is "NO" since the ball does not fall in the position of the hole.

 

Code:

/* package codechef; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Codechef{
	public static void main (String[] args) throws java.lang.Exception	{
		int t;
		Scanner sc = new Scanner(System.in);
		t=sc.nextInt();
		for(int i=0;i<t;i++){
		    int n,x,k;
		    n=sc.nextInt();
		    x=sc.nextInt();
		    k=sc.nextInt();
		    if(x%k==0)
		    System.out.println("YES");
		    else if(((n+1)-x)%k==0)
		    System.out.println("YES");
		    else
		    System.out.println("NO");
		}
		sc.close();
	}
}

Recent Posts

See All

6 Comments


Deepak kumar soni
Deepak kumar soni
May 08, 2021

Here is the solution:

Happy coding to all:


#include <bits/stdc++.h>

using namespace std;


int main() {

// your code goes here

int t;

cin>>t;

while(t--)

{

int n,x,k;

cin>>n>>x>>k;

int b = (n+1)%k;

if(x%k==0 || x%k==b)

{

cout<<"YES"<<endl;

}else{

cout<<"NO"<<endl;

}

}

return 0;

}


Like
Manish Pandey
Manish Pandey
May 08, 2021
Replying to

my solution of modular is partially correct can you point out the mistake??

and can you give me the code of tic tac toe game??


#include <iostream>

using namespace std;

#define ll long long


ll md(ll a, ll b) { // computes a % b;

return (a - b * (a / b));

}

int main() {

// your code goes here

ll t;

cin>>t;

while(t--){

ll n,m;

ll s=0;

cin>>n>>m;

for(ll b=1;b<=n;b++){

for(ll a=1;a<b;a++){

if(md(md(m,a),b)==md(md(m,b),a)){

s+=1;

}

}

}

cout<<s<<"\n";

}

return 0;

}

Like

17-4E9 Prem Sai Vittal
17-4E9 Prem Sai Vittal
May 07, 2021

Can I send

Like
Manish Pandey
Manish Pandey
May 08, 2021
Replying to

yes you can write it in the chat

Like
bottom of page