Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
31 lines (27 loc) · 961 Bytes

File metadata and controls

31 lines (27 loc) · 961 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
//Problem: https://www.hackerrank.com/challenges/kangaroo
//Java 8
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int x1 = in.nextInt();
int v1 = in.nextInt();
int x2 = in.nextInt();
int v2 = in.nextInt();
while(x1 <= x2)// Once the kangaroos pass their velocitys prevent them from meeting again.
{ //This works based on the constraint that x1 < x2 but can be easily adjusted to work with x2 < x1
if(x1 == x2)
{
System.out.println("YES");
System.exit(0);//Once they meet we don't need to continue checking
}
x1 += v1;
x2 += v2;
}
System.out.println("NO");
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.