#204248 (C++14) No.645 Count Permutation

• 問題: No.645 Count Permutation
• ユーザー: yosupot
• 提出日時: 2017-09-12 14:31:47
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 34 ms / 2,000 ms
• コード長: 2,593 bytes
• コンパイル時間: 1,152 ms
• コンパイル使用メモリ: 112,016 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-12-31 06:47:35
• 合計ジャッジ時間: 2,884 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
other	AC * 34

ソースコード

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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <complex>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T>
T pow(T x, ll n, T r = 1) {
    while (n) {
        if (n & 1) r *= x;
        x *= x;
        n >>= 1;
    }
    return r;
}
template<uint MD>
struct ModInt {
    uint v;
    ModInt() : v{0} {}
    ModInt(ll v) : v{normS(v%MD+MD)} {}
    explicit operator bool() const {return v != 0;}
    static uint normS(const uint &x) {return (x<MD)?x:x-MD;};
    static ModInt make(const uint &x) {ModInt m; m.v = x; return m;}
    static ModInt inv(const ModInt &x) {return pow(ModInt(x), MD-2);} 
    ModInt operator+(const ModInt &r) const {return make(normS(v+r.v));}
    ModInt operator-(const ModInt &r) const {return make(normS(v+MD-r.v));}
    ModInt operator*(const ModInt &r) const {return make((ull)v*r.v%MD);}
    ModInt operator/(const ModInt &r) const {return *this*inv(r);}
    ModInt& operator+=(const ModInt &r) {return *this=*this+r;}
    ModInt& operator-=(const ModInt &r) {return *this=*this-r;}
    ModInt& operator*=(const ModInt &r) {return *this=*this*r;}
    ModInt& operator/=(const ModInt &r) {return *this=*this/r;}
};
using Mint = ModInt<TEN(9)+7>;
const int MN = TEN(5) + TEN(3);
Mint fact[MN], iFac[MN];
void first() {
    fact[0] = Mint(1);
    for (int i = 1; i < MN; i++) {
        fact[i] = fact[i-1] * i;
    }
    for (int i = 0; i < MN; i++) {
        iFac[i] = Mint(1)/fact[i];
    }
}
int main() {
    first();
    int n; ll l, r;
    cin >> n >> l >> r;
    Mint ans = 0;
    if (l == 0) {
        ans += fact[n] - fact[n-1];
    }
    V<Mint> dp(80);
    dp[0] = 1;
    for (int i = 1; i <= n-2; i++) {
        for (int j = 79; j >= 0; j--) {
            dp[j] *= i;
            if (j) dp[j] += dp[j-1];
        }
/*        for (int j = 0; j <= 5; j++) {
            cout << dp[j].v << ", ";
        }
        cout << endl;*/
    }
    for (int i = 1; i <= 61; i++) {
        ll u = 1LL << i;
        if (l <= u && u <= r) {
//            cout << "OK " << i << endl;
            ans += dp[i-1];
        }
    }
    cout << ans.v << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX