문제
Five friends put their hats in a pile and each takes one back at random. In how many ways can it happen that nobody gets their own hat? An arrangement of n items in which no item stays in its original position is called a derangement. The counts start 1, 0, 1, 2, 9, 44 and follow D(n) = (n − 1) × (D(n − 1) + D(n − 2)).
Implement derangements(n).
Input
n: The number of items.
Output
Return the number of derangements of n items. D(0) is 1 (the empty arrangement moves nothing that could stay) and D(1) is 0.
제약 조건
0 ≤ n ≤ 20
예시
입력:
n = 3
예상 출력:
expected = 2
입력:
long long n = 3;
예상 출력:
long long expected = 2;
입력:
long n = 3;
예상 출력:
long expected = 2;
설명
For items A, B, C only BCA and CAB move every item, so the answer is 2.
입력:
n = 4
예상 출력:
expected = 9
입력:
long long n = 4;
예상 출력:
long long expected = 9;
입력:
long n = 4;
예상 출력:
long expected = 9;
설명
D(4) = 3 × (D(3) + D(2)) = 3 × (2 + 1) = 9.
접근 방법
먼저 스스로 풀어 본 뒤 힌트를 하나씩 열어 보세요.
힌트 1
Start from D(0) = 1 and D(1) = 0.
힌트 2
Each next value uses the two previous ones and the current n.
힌트 3
Only the last two values are needed at any time.
예상 복잡도
O(n) time, O(1) extra space
참고 자료
이 문제는 CodeUtility에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.