-
Notifications
You must be signed in to change notification settings - Fork 54
/
Copy pathJava.java
54 lines (46 loc) · 1.41 KB
/
Java.java
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
/****************************************/
/* */
/* CodinGame.com Solutions by pathosDev */
/* */
/* Puzzle: The River I. */
/* Difficulty: Easy */
/* Date solved: 09.11.2018 */
/* */
/****************************************/
import java.util.Scanner;
public class Solution
{
public static void main(String[] args)
{
//Read inputs.
Scanner scanner = new Scanner(System.in);
long r1 = Long.parseLong(scanner.nextLine());
long r2 = Long.parseLong(scanner.nextLine());
//Find meeting point.
while (r1 != r2)
{
if (r1 < r2)
{
r1 = GetNextRiverNumber(r1);
}
else
{
r2 = GetNextRiverNumber(r2);
}
}
//Output meeting point.
System.out.println(r1);
}
//Calculates the a following river number (e.g 7 -> 14, 14 -> 19, etc).
private static long GetNextRiverNumber(long riverNumber)
{
long nextRiverNumber = riverNumber;
while (riverNumber > 0)
{
nextRiverNumber += riverNumber % 10;
riverNumber -= riverNumber % 10;
riverNumber /= 10;
}
return nextRiverNumber;
}
}