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. Prepare
  2. Algorithms
  3. Implementation
  4. Beautiful Days at the Movies
  5. Discussions

Beautiful Days at the Movies

Sort by

recency

|

1773 Discussions

|

  • sheiktaher1995
     + 0 comments

    //check the code int reverse_num(int num){ int temp = 0; int neg = num < 0; if (neg) num = -num; while(num){ temp = (temp*10) + (num%10); num /= 10;
    } return neg ? -temp:temp; }

    int beautifulDays(int i, int j, int k) { int beautiful_count = 0;

    for(int day=i; day <= j; day++){
    if(abs(day - reverse_num(day)) % k == 0) {
        beautiful_count++;
    }
}
return beautiful_count;

    }

  • henrylong7191
     + 0 comments
    function reverseNumber(num: number) {
  let rev = 0;

  while (num > 0) {
    rev = rev * 10 + (num % 10);
    num = Math.floor(num / 10);
  }

  return rev;
}

function beautifulDays(i: number, j: number, k: number): number {
  let cnt = 0;

  for (let num = i; num <= j; num++) {
    let reversed_num = reverseNumber(num);
    if ((num - reversed_num) % k === 0) {
      cnt++;
    }
  }

  return cnt;
}

  • tongyou1995
     + 0 comments

    My initial idea was to use str to convert to a string and reverse using indexing and convert back:

    import os
def beautifulDays(i, j, k):
    num_beautiful_days = 0
    for num in range(i, j+1):
        num_reverse = int(str(num)[::-1])
        if abs(num-num_reverse) % k == 0:
            num_beautiful_days += 1
    return num_beautiful_days

if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    first_multiple_input = input().rstrip().split()
    i = int(first_multiple_input[0])
    j = int(first_multiple_input[1])
    k = int(first_multiple_input[2])
    result = beautifulDays(i, j, k)

    fptr.write(str(result) + '\n')
    fptr.close()

  • akulbachandra67
     + 0 comments

    PYTHON SOLUTION

    c = 0
for n in range(i,j+1):
    a = int(str(n)[::-1])
    if abs(n-a)%k == 0:
        c += 1 
return c

  • trupti29
     + 0 comments

    def beautifulDays(i, j, k): count = 0 for r in range(i,j+1): str1 = str(r) rev_str = str1[::-1] rev_num = int(rev_str) diff = abs(r-rev_num) num = diff/k num1 = diff//k if num == num1: count += 1 return count