-
Notifications
You must be signed in to change notification settings - Fork 694
/
Copy pathSolution.java
29 lines (24 loc) · 911 Bytes
/
Solution.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
//Problem: https://www.hackerrank.com/challenges/beautiful-days-at-the-movies
//Java 8
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
Scanner input = new Scanner(System.in);
int i = input.nextInt();
int j = input.nextInt();
int k = input.nextInt();
int beautifulDays = 0;
for(int x = i; x <= j; x++)
{
StringBuilder day = new StringBuilder(String.valueOf(x));
int xReverse = Integer.parseInt(day.reverse().toString());
if(Math.abs(x-xReverse) % k == 0)
{
beautifulDays++;
}
}
System.out.println(beautifulDays);
}
}