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()

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           

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

my very easy cpp solution

int beautifulDays(int i, int j, int k) {

int rem,count=0,temp;

for(int m=i;m <=j ; m++){///for looping
    temp=m;
    int rev=0;
    while(temp > 0){
    }

    if(abs(m - rev) % k ==0){  \\for checking it is equallly divisible or not
        count++;

    }
}
return count;

}

my very easy cpp solution

int beautifulDays(int i, int j, int k) {

int rem,count=0,temp;

for(int m=i;m <=j ; m++){///for looping
    temp=m;
    int rev=0;
    while(temp > 0){
         rem = temp % 10;
         rev = (rev * 10 ) + rem;
         temp = temp/10;  //for reversing number
    }

    if(abs(m - rev) % k ==0){  \\for checking it is equallly divisible or not
        count++;

    }
}
return count;

}