結果
| 問題 | No.2176 LRM Question 1 | 
| コンテスト | |
| ユーザー |  | 
| 提出日時 | 2023-06-16 14:30:08 | 
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) | 
| 結果 | 
                                AC
                                 
                             | 
| 実行時間 | 70 ms / 2,000 ms | 
| コード長 | 2,426 bytes | 
| コンパイル時間 | 1,861 ms | 
| コンパイル使用メモリ | 193,968 KB | 
| 最終ジャッジ日時 | 2025-02-14 03:45:43 | 
| ジャッジサーバーID (参考情報) | judge5 / judge5 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| sample | AC * 3 | 
| other | AC * 22 | 
ソースコード
// github.com/Johniel/contests
// yukicoder/2176/main.cpp
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
// #define endl "\n"
using namespace std;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << "," << p.second << ")"; return os; }
template<typename P, typename Q> istream& operator >> (istream& is, pair<P, Q>& p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator << (ostream& os, vector<T> v) { os << "("; for (auto& i: v) os << i << ","; os << ")"; return os; }
template<typename T> istream& operator >> (istream& is, vector<T>& v) { for (auto& i: v) is >> i; return is; }
template<typename T> ostream& operator << (ostream& os, set<T> s) { os << "#{"; for (auto& i: s) os << i << ","; os << "}"; return os; }
template<typename K, typename V> ostream& operator << (ostream& os, map<K, V> m) { os << "{"; for (auto& i: m) os << i << ","; os << "}"; return os; }
template<typename E, size_t N> istream& operator >> (istream& is, array<E, N>& a) { for (auto& i: a) is >> i; return is; }
template<typename E, size_t N> ostream& operator << (ostream& os, array<E, N>& a) { os << "[" << N << "]{"; for (auto& i: a) os << i << ","; os << "}"; return os; }
template<typename T> inline T setmax(T& a, T b) { return a = std::max(a, b); }
template<typename T> inline T setmin(T& a, T b) { return a = std::min(a, b); }
__attribute__((constructor)) static void ___initio(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.setf(ios_base::fixed); cout.precision(15); return ; }
using lli = long long int;
using ull = unsigned long long;
using str = string;
template<typename T> using vec = vector<T>;
constexpr array<int, 8> di({0, 1, -1, 0, 1, -1, 1, -1});
constexpr array<int, 8> dj({1, 0, 0, -1, 1, -1, -1, 1});
int main(int argc, char *argv[])
{
  lli x, y, mod;
  while (cin >> x >> y >> mod) {
    const int M = 1e6 + 3;
    static lli fact[M];
    fill(fact, fact + M, 0);
    fact[0] = 1;
    for (int i = 1; i < M; ++i) {
      fact[i] = fact[i - 1] * i % mod;
    }
    setmin(x, mod);
    setmin(y, mod);
    lli a = 0;
    lli b = 0;
    for (int i = y; 0 < i; --i) {
      (a = (a + 1) * fact[i] % mod) %= mod;
    }
    for (int i = x-1; 0 < i; --i) {
      (b = (b + 1) * fact[i] % mod) %= mod;
    }
    cout << (a - b + mod) % mod << endl;
  }
  return 0;
}
            
            
            
        