For this Question: Find number of ways an integer N can be represented as a sum of unique natural numbers.First line contain an integer T denoting number of test cases. Each test case contains a single integer N.

Constraint:-
1 <= T <= 100
0 <= N <= 120Print a single integer containing number of ways.Sample input
4
6
1
4
2

Sample output:-
4
1
2
1

Explanation:-
TestCase1:-
6 can be represented as (1, 2, 3), (1, 5), (2, 4), (6), I have written this Solution Code: for _ in range(int(input())):
    x = int(input())
    n = 1
    dp = [1] + [0] * x
    for i in range(1, x + 1):
        u = i ** n
        for j in range(x, u - 1, -1):
            dp[j] += dp[j - u]
    if x==0:
        print(0)
    else:
        print(dp[-1]), In this Programming Language: Python, Now tell me if this Code is compilable or not?