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.

- Practice
- Functional Programming
- Recursion
- The Sums of Powers

# The Sums of Powers

# The Sums of Powers

Find the number of ways that a given integer, , can be expressed as the sum of the power of unique, natural numbers.

**Input Format**

The first line contains an integer .

The second line contains an integer .

**Constraints**

**Output Format**

Output a single integer, the answer to the problem explained above.

**Sample Input 0**

```
10
2
```

**Sample Output 0**

```
1
```

**Explanation 0**

If and , we need to find the number of ways that can be represented as the sum of squares of unique numbers.

This is the only way in which can be expressed as the sum of unique squares.

**Sample Input 1**

```
100
2
```

**Sample Output 1**

```
3
```

**Explanation 1**

**Sample Input 2**

```
100
3
```

**Sample Output 2**

```
1
```

**Explanation 2**

can be expressed as the sum of the cubes of .

. There is no other way to express as the sum of cubes.