D. New Year and the Permutation Concatenation(打表找规律)

http://codeforces.com/contest/1091/problem/D

D. New Year and the Permutation Concatenation

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Let n

be an integer. Consider all permutations on integers 1 to n in lexicographic order, and concatenate them into one big sequence p. For example, if n=3, then p=[1,2,3,1,3,2,2,1,3,2,3,1,3,1,2,3,2,1]. The length of this sequence will be n⋅n!

.

Let 1≤i≤j≤n⋅n!

be a pair of indices. We call the sequence (pi,pi+1,…,pj−1,pj) a subarray of p. Its length is defined as the number of its elements, i.e., j−i+1. Its sum is the sum of all its elements, i.e., ∑jk=ipk

.

You are given n

. Find the number of subarrays of p of length n having sum n(n+1)2. Since this numb