We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. Algorithms
  3. Implementation
  4. Beautiful Days at the Movies
  5. Discussions

Beautiful Days at the Movies

  • kevinmathis08 + 11 comments

    Nice solution! Here is my not so elegant solution, however maybe easier to understand for beginners..

    i,j,k = [int(x) for x in input().split()]
count = 0
for x in range(i,j+1):
    if (x - int(str(x)[::-1])) % k == 0:
        count += 1
print(count)
    • himaja97 + 0 comments
      [deleted]
    • Harshith1995 + 0 comments
      [deleted]
    • alpha52omega41 + 1 comment

      I have done the same thing, python is amazing.....

      • amylokh + 0 comments

        Whoa!

    • benazus + 0 comments

      my code exactly

    • pgppratik + 0 comments

      Cool, mine is the same!!

    • ghassan_karwchan + 1 comment
      def beautifulDays(i, j, k):
    return sum ([1 for i in range(i, j + 1) if (int(str(i)[::-1]) - i) % k == 0])
      • vishu_vishwanat1 + 0 comments

        Awesome bro!!

    • joshuajuicehan + 1 comment

      I don't quite understand what you are saying in the conditional statement. Can you explain?

      • shashankjain_ec2 + 0 comments

        I am checking if the difference between number and reversed number is evenly divisible by k or not.

    • probipka + 0 comments

      I think your solution is more elegant, because it's more readable.

    • 18211a05l0 + 0 comments

      thank you after seeing this, ihave learned a new method

    • peacefulbaba10 + 0 comments

      quite appreciable

    • dineshmatrix675 + 0 comments

      please explain this code .