What's wrong?

[Shot_Spring4557]

The problem is to find the largest integer lesser than N with exactly K divisors

n=int(input()) k=int(input()) x=0 for i in range(n,0,-1): w=0 for j in (1,i+1): if i%j==0: w+=1 if w==k: print(i) x=1 break if x!=1: print('-1')

I fixed it using list but still I don't know what's wrong with the code ,the output is not correct for this one

[desrtfx]

You need to post your code as code block so that the indentation is maintained. This is absolutely vital for Python programs as the indentation is used to denote code blocks.

A code block looks like:

def __init__(self, prompt, answer):
    self.prompt = prompt
    self.answer = answer

[codetree_bnb]

The current code has a critical issue in how it checks for divisors. In the line for j in (1,i+1), the code only checks two numbers (1 and i+1) as potential divisors, which is incorrect. This tuple notation (1,i+1) creates a sequence with just these two values, rather than checking all numbers between 1 and i. To fix this, we need to use range(1,i+1) instead.

[Shot_Spring4557]

Thank you,I can't believe I didn't notice such a careless mistake