#830960 (C++23) No.2176 LRM Question 1

• 問題: No.2176 LRM Question 1
• ユーザー: k1suxu
• 提出日時: 2023-01-06 22:29:26
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 51 ms / 2,000 ms
• コード長: 1,913 bytes
• コンパイル時間: 2,841 ms
• コンパイル使用メモリ: 246,732 KB
• 実行使用メモリ: 18,944 KB
• 最終ジャッジ日時: 2024-11-30 18:52:22
• 合計ジャッジ時間: 4,118 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 22

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i = 0LL; i < (ll)n; i++)
#define FOR(n) for(ll i = 0LL; i < (ll)n; i++)
#define repi(i,a,b) for(ll i = (ll)a; i < (ll)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<ll>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vs vector<string>
#define vvs vector<vs>
#define vc vector<char>
#define vvc vector<vc>
#define pii pair<ll,ll>
#define pllll pair<ll,ll>
#define vpii vector<pair<ll,ll>>
#define vpllll vector<pair<ll,ll>>
#define vpis vector<pair<ll,string>>
#define vplls vector<pair<ll, string>>
#define vpsi vector<pair<string, ll>>
#define vpsll vector<pair<string, ll>>
template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}
using ll = long long;
using ld = long double;
using ull = unsigned long long;
const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = acos(-1);
const ll mod = 998244353;
int dx[] = {-1, 0LL, 1, 0LL, -1, 1, -1, 1};
int dy[] = {0LL, -1, 0LL, 1, -1, -1, 1, 1};
#define int long long
void solve() {
    //1^L*2^(L-1)*...*L+1^(L+1)*2^L*3^(L-1)*...*(L+1)*...*
    //f(X)=
    //初項1
    //項数X
    //a_(i+1)=a_i*(i+1)!
    //S_(n+1)=S_n * ((n+1)! + 1)
    //s_(n+1)/
    //S_1=1
    //の時の\sum(a_1...X)
    //ans = f(R)-f(L)
    int l, r, m;
    cin >> l >> r >> m;
    r = min(r, m);
    vi fact(r+1, 1);
    repi(i, 1, r+1) fact[i] = fact[i-1] * i % m;
    vi s(r+1);
    s[1] = 1;
    int now = 1;
    repi(i, 1, r) {
        (now *= fact[i+1]) %= m;
        s[i+1] = (s[i] + now) % m;
    }
    if(l > r) cout << 0 << endl;
    else cout << ((s[r] - s[l-1])%m+m)%m << endl;
}
//euler tourの点更新、辺更新の追加
signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0LL;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX