Beautiful Arrangement
Suppose you have n integers labeled 1 through n. A permutation of those n integers perm (1-indexed) is considered a beautiful arrangement if for every i (1 <= i <= n), either of the following is true:
perm[i]is divisible byi.iis divisible byperm[i].
Given an integer n, return the number of the beautiful arrangements that you can construct.
Example 1
Input
n = 2Output
2There are two beautiful arrangements,
[1, 2] and [2, 1], that satisfy the divisibility conditions for every position.Example 2
Input
n = 1Output
1The only permutation is
[1], which satisfies the divisibility condition.Constraints
- 1 <= n <= 15