Help me in solving AVGPERM problem

help
,
1

My issue

def average_permutation(T, cases):
results =
for N in cases:
# Generate the permutation in descending order
permutation = ’ '.join(map(str, range(N, 0, -1)))
results.append(permutation)
return results

Read input

T = int(input().strip())
cases = [int(input().strip()) for _ in range(T)]

Get results

results = average_permutation(T, cases)

Print results

for result in results:
print(result)

My code

# cook your dish here
def average_permutation(T, cases):
    results = []
    for N in cases:
        # Generate the permutation in descending order
        permutation = ' '.join(map(str, range(N, 0, -1)))
        results.append(permutation)
    return results

# Read input
T = int(input().strip())
cases = [int(input().strip()) for _ in range(T)]

# Get results
results = average_permutation(T, cases)

# Print results
for result in results:
    print(result)

Learning course: Additional practice problems
Problem Link: https://www.codechef.com/learn/course/kl-daa-practice/KLDAAPR01/problems/AVGPERM