[PS][정수론]/[BOJ][17466][n! mod p]

cpp17466.cpp

#include <iostream>

using namespace std;

int n, p;
long long ans = 1;
int main(void) {
    cin.tie(NULL);
    ios::sync_with_stdio("false");
    cin >> n >> p;
    for (int i = 1; i <= n; i++) {
        ans *= i;
        ans %= p;
    }
    cout << ans << "\n";
    return 0;
}