LeetCode --- 1175. Prime Arrangements 解题报告
Posted 杨鑫newlfe
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1175. Prime Arrangements 解题报告相关的知识,希望对你有一定的参考价值。
Return the number of permutations of 1 to n
so that prime numbers are at prime indices (1-indexed.)
(Recall that an integer is prime if and only if it is greater than 1, and cannot be written as a product of two positive integers both smaller than it.)
Since the answer may be large, return the answer modulo 10^9 + 7
.
Example 1:
Input: n = 5 Output: 12 Explanation: For example [1,2,5,4,3] is a valid permutation, but [5,2,3,4,1] is not because the prime number 5 is at index 1.
Example 2:
Input: n = 100 Output: 682289015
Constraints:
1 <= n <= 100
所有代码均可在Github中找到:
下载链接</
以上是关于LeetCode --- 1175. Prime Arrangements 解题报告的主要内容,如果未能解决你的问题,请参考以下文章
Leetcode-5173 Prime Arrangements(质数排列)
Leetcode 762. Prime Number of Set Bits in Binary Representation
[LeetCode] Prime Number of Set Bits in Binary Representation
leetcode-762-Prime Number of Set Bits in Binary Representation