import sys
sys.setrecursionlimit(1000010)
N = 1000010
n = int(input())
state = [0] * N
nums = [0] * N
sum = 0
def dfs(u,nums,state):
if u > n:
temp = 0
for i in range(1,n + 1):
for j in range(1,i):
if nums[i] > nums[j]:
temp += 1
# print(temp)
global sum
sum += temp
else:
for i in range(1,n + 1):
if state[i] == 0:
state[i] = 1
nums[u] = i
dfs(u + 1,nums,state)
state[i] = 0
dfs(1,nums,state)
print(sum)
全排列的价值
最新推荐文章于 2024-10-01 05:07:35 发布