N阶乘MOD P

#include <iostream> using namespace std; int mod(long long int n,long long int p) { if (n == 0) return 1; else return (mod(n - 1, p)*n%p) % p; } int main() { long long int n,p; cin>>n>>p; cout<<mod(n,p); }