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. Modified Kaprekar Numbers
  5. Discussions

Modified Kaprekar Numbers

  • sreekishore55
     + 0 comments

    Hello all! This is my code and it is giving the expected output(I run it in IDLE shell). But I don't know why some testcase(4/7) failed while submitting it in Hackerrank editor. If you spot any mistakes in my logic do comment.

    result=[]
p=int(input())
q=int(input())
for i in range(p,q+1):
    if i==1:
        result.append(i)
    else:
        sq=i*i
        sq=str(sq)
        length=len(sq)
        if length>1:
            sq=list(sq)
            l=''
            r=''
            for j in range(length//2):
                l,sq[j]=l+sq[j],''
            for k in range(length):
                r=r+sq[k]
            l,r=int(l),int(r)
            if l+r==i:
                result.append(i)
            else:
                for m in range(len(str(l))-1):
                    l=l/10
                    if l+r==i:
                        result.append(i)
                        break               
for i in result:
    print(i,end=' ')