#include <iostream>
int main()
{
int n, p;
std::cin >> n >> p;
int i = 1;
long long res = 1;
for (; i <= n; ++i)
{
res = i * res % p;
}
std::cout << res << std::endl;
return 0;
}
51nod 1008 N的阶乘mod P
最新推荐文章于 2024-10-17 21:05:59 发布
#include <iostream>
int main()
{
int n, p;
std::cin >> n >> p;
int i = 1;
long long res = 1;
for (; i <= n; ++i)
{
res = i * res % p;
}
std::cout << res << std::endl;
return 0;
}