시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
2 초 | 512 MB | 9 | 6 | 6 | 100.000% |
Consider the following problem:
Consider the following algorithm to solve it:
You are given a single integer $n$. Find the number of permutations on which the described algorithm solves the problem incorrectly.
The only line contains a single integer $n$ ($1 \le n \le 42$).
Print the number of permutations on which the described algorithm works incorrectly.
3
1
7
1023
In the first example test case, for $n = 3$, the only permutation resulting in an incorrect output is $\langle 3, 2, 1 \rangle$. The algorithm returns $\langle 2, 1, 3 \rangle$, while the correct answer is $\langle 1, 3, 2 \rangle$.