codeforces 1391 C. Cyclic Permutations（数学 思维）

题意

链接: link.

思路

参考链接: link.

AC代码

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 1E9 + 7;
int main()
{
    int n;
    cin >> n;
    ll a = 1, b = 1;
    for (int i = 1; i < n; i++)
    {
        a = (a * i) % mod;
        b = (b * 2) % mod;
    }
    a = (a * n) % mod;
    cout << (a - b + mod) % mod << endl;
    //system("pause");
    return 0;
}