Lưu ý: Các code mẫu dưới đây chỉ mang tính tham khảo và có thể không AC được bài tập này

Code mẫu của happyboy99x

#include<bits/stdc++.h>
using namespace std;

const int P = 76213, N = 5000;

int fac[N+1], infac[N+1];

int powMod(int a, int n) {
    int res = 1;
    for(int x = n; x > 0; x >>= 1) {
        if((x & 1) == 1) res = 1LL * res * a % P;
        a = 1LL * a * a % P;
    }
    return res;
}

void init() {
    fac[0] = 1;
    for(int i = 1; i <= N; ++i) fac[i] = 1LL * fac[i-1] * i % P;
    for(int i = 0; i <= N; ++i) infac[i] = powMod(fac[i], P-2);
}

int C(int n, int k) {
    if(k < 0 || k > n) return 0;
    return 1LL * fac[n] * infac[k] % P * infac[n-k] % P;
}

int main() {
    init();
    int n; cin >> n;
    int res = 0;
    for(int i = 0; i <= n; ++i)
        if((i & 1) == 0) res = (res + 1LL * fac[n-i] * C(n, i)) % P;
        else res = (res - 1LL * fac[n-i] * C(n, i)) % P;
    cout << (res + P) % P << endl;
    return 0;
}

Code mẫu của ladpro98

program dper;

const   base = 76213;
        fi='';
var     n,i:longint;
        s,t:int64;
        inp:text;
begin
        assign(inp,fi);
        reset(inp);
        readln(inp,n);
        close(inp);
        if odd(n) then s:=-1
        else s:=1;
        t:=s;
        for i:=n downto 3 do
        begin
                t:=(-t*i) mod base;
                s:=(s+t+base) mod base;

        end;
        write(s);
end.

Code mẫu của hieult

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <fstream>
#include <ctime>
#include <deque>
#include <bitset>
#include <cctype>
#include <utility>
#include <cassert>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;

#define Rep(i,n) for(int i = 0; i < (n); ++i)
#define Repd(i,n) for(int i = (n)-1; i >= 0; --i)
#define For(i,a,b) for(int i = (a); i <= (b); ++i)
#define Ford(i,a,b) for(int i = (a); i >= (b); --i)
#define Fit(i,v) For(__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define Fitd(i,v) For(__typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define ms(a,x) memset(a, x, sizeof(a))

template<class F, class T> T convert(F a, int p = -1) { stringstream ss; if (p >= 0) ss << fixed << setprecision(p); ss << a; T r; ss >> r; return r; }
template<class T> T gcd(T a, T b) { T r; while (b != 0) { r = a % b; a = b; b = r; } return a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> T sqr(T x) { return x * x; }
template<class T> T cube(T x) { return x * x * x; }
template<class T> int getbit(T s, int i) { return (s >> i) & 1; }
template<class T> T onbit(T s, int i) { return s | (T(1) << i); }
template<class T> T offbit(T s, int i) { return s & (~(T(1) << i)); }
template<class T> int cntbit(T s) { return s == 0 ? 0 : cntbit(s >> 1) + (s & 1); }
const int bfsz = 1 << 16; char bf[bfsz + 5]; int rsz = 0;int ptr = 0;
char gc() { if (rsz <= 0) { ptr = 0; rsz = (int) fread(bf, 1, bfsz, stdin); if (rsz <= 0) return EOF; } --rsz; return bf[ptr++]; }
void ga(char &c) { c = EOF; while (!isalpha(c)) c = gc(); }
int gs(char s[]) { int l = 0; char c = gc(); while (isspace(c)) c = gc(); while (c != EOF && !isspace(c)) { s[l++] = c; c = gc(); } s[l] = '\0'; return l; }
template<class T> bool gi(T &v) {
    v = 0; char c = gc(); while (c != EOF && c != '-' && !isdigit(c)) c = gc(); if (c == EOF) return false; bool neg = c == '-'; if (neg) c = gc();
    while (isdigit(c)) { v = v * 10 + c - '0'; c = gc(); } if (neg) v = -v; return true;
}

typedef pair<int, int> II;

const double PI = acos(-1.0);
const double eps = 1e-9;

const int inf = (int)1e9 + 5;
const ll linf = (ll)1e17 + 5;
int dr[4] = {-1, 0, +1, 0};
int dc[4] = {0, -1, 0, +1};
const ll mod = 76213ll;

#define maxn 5005

ll f[maxn];
ll C[maxn][maxn], giaithua[maxn];

void init(){
    ms(f, 0);
    f[0] = 1;
    giaithua[0] = 1;
    For(i, 1, maxn - 1) giaithua[i] = giaithua[i - 1] * i % mod;
    ms(C, 0);
    Rep(i, maxn) C[0][i] = 1;
    For(i, 1, maxn - 1) For(j, 1, i) {
        C[j][i] = C[j - 1][i - 1] + C[j][i - 1];
        if(C[j][i] >= mod) C[j][i] -= mod;
    }

    For(i, 2, maxn - 1){
        For(j, 1, i - 1){
            f[i] = (f[i] + C[j][i - 1] * giaithua[j] * f[i - j - 1]) % mod;
        }
    }
}

int main(){
//  freopen("in.txt", "r", stdin);
//  freopen("out.txt", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    init();
    int n;
    cin >> n;
    cout << f[n] << endl;
//  cout << clock() << endl;
}

Code mẫu của skyvn97

#include<bits/stdc++.h>
#define MAX   5005
typedef long long ll;
const ll mod=76213LL;
ll c[MAX][MAX];
ll f[MAX];
ll r[MAX];
int n;
ll res;
void inc(ll &x,const ll &y) {
    x=(x+y%mod+mod)%mod;
}
void init(void) {
    scanf("%d",&n);
    res=0LL;
    int i,j;
    f[0]=1LL;
    for (i=1;i<=n;i=i+1) f[i]=(f[i-1]*i)%mod;
    for (i=1;i<=n;i=i+1) {
        c[i][0]=0LL;
        c[0][i]=1LL;        
    }
    c[0][0]=1LL;
    for (i=1;i<=n;i=i+1)
        for (j=1;j<=n;j=j+1) {
            if (i>j) c[i][j]=0LL;
            if (i==j) c[i][j]=1LL;
            if (i<j) c[i][j]=(c[i-1][j-1]+c[i][j-1])%mod;
        }
    res=f[n];
    for (i=1;i<=n;i=i+1) r[i]=1LL;
}
ll result(const int &i) {
    return ((c[i][n]*f[n-i])%mod);
}
void count(void) {
    int i,j;
    ll t;
    for (i=1;i<=n;i=i+1) {
        t=-r[i];
        inc(res,(t*result(i))%mod);
        for (j=i;j<=n;j=j+1)
            inc(r[j],(t*c[i][j])%mod);
    }
    printf("%lld",res);
}
int main(void) {
    init();
    count();
    return 0;
}