QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#777354#9553. The HermitbaitangAC ✓79ms30552kbC++203.2kb2024-11-24 01:17:032024-11-24 01:17:04

Judging History

你现在查看的是最新测评结果

  • [2024-11-24 01:17:04]
  • 评测
  • 测评结果:AC
  • 用时:79ms
  • 内存:30552kb
  • [2024-11-24 01:17:03]
  • 提交

answer

#include<bits/stdc++.h>

using pii = std::pair<int, int>;

using i64 = long long;

static constexpr int mod = 998244353;

class combMath
{
public:
    static constexpr int size = 2e5;
    i64 fact[size + 1];
    i64 finv[size + 1];
    i64 inve[size + 1];
    static constexpr int mod = 998244353;
    void factor()
    {
        fact[0] = 1; fact[1] = 1;
        inv();
        finv[0] = 1;
        finv[1] = inve[1];
        for (int i = 2; i <= size; ++i) fact[i] = fact[i - 1] * i % mod, finv[i] = finv[i - 1] * inve[i] % mod;
    }
    void inv()
    {
        inve[1] = 1;
        for (int i = 2; i <= size; ++i)
        {
            inve[i] = (mod - mod / i) * inve[mod % i] % mod;
        }
    }
public:
    combMath() { factor(); }
    i64 power(i64 x, i64 p)
    {
        i64 temp = p, ans = 1;
        while (temp)
        {
            if (temp & 1) ans = ans * x % mod;
            temp >>= 1;
            x = x * x % mod;
        }
        return ans;
    }
    i64 getInv(i64 x)
    {
        return power(x, mod - 2);
    }
    i64 inv(i64 x)
    {
        return inve[x];
    }
    i64 facInv(i64 x)
    {
        return finv[x];
    }
    i64 getFac(i64 obj)
    {
        return fact[obj];
    }
    i64 perm(i64 n, i64 m, bool mode)
    {
        if (mode) return fact[n] * finv[n - m] % mod;
        else return fact[n] / fact[n - m];
    }
    i64 comb(i64 n, i64 m, bool mode = 1)
    {
        if (mode) return fact[n] * finv[n - m] % mod * finv[m] % mod;
        else return fact[n] / fact[n - m] / fact[m];
    }
    i64 stirling(i64 n, i64 m) // 'n' balls into 'm' boxes, boxes DO NOT differ while balls differ.
    {
        i64 ans = 0;
        for (int i = 0; i < m; ++i)
            ans = (ans + (i & 1 ? -1 : 1) * comb(m, i, 1) * power(m - i, n) % mod) % mod;
        ans = ans * finv[m] % mod;
        return (ans + mod) % mod;
    }
    i64 catalan(int n, int mode) // n different nums pop in a stack in an certain order, how many ramifications there will be.
    {
        std::vector<i64> dp(n + 1, 1);
        if (mode) for (int i = 1; i <= n; ++i) dp[i] = dp[i - 1] * (4LL * i % mod - 2) % mod * inv(i + 1) % mod;
        else for (int i = 1; i <= n; ++i) dp[i] = dp[i - 1] * (4 * i - 2) / (i + 1);
        return dp[n];
    }
} cm;

using namespace std;
void solve()
{
    int m, n;
    cin >> m >> n;
    long long ans = (cm.comb(m, n, 1) * n) % mod;
    vector<vector<long long>>f(m + 1, vector<long long>(25, 0));
    for (int i = 1; i <= m; i++)
    {
        f[i][0] = 1;
        for (int j = (i << 1); j <= m; j += i)
        {
            for (int k = 0; k < 20; k++)
            {
                f[j][k + 1] = (f[j][k + 1] + f[i][k]) % mod;
            }
        }
    }
    for (int i = 1; i <= m; i++)
    {
        int cnt = m / i - 1;
        for (int j = 0; j <= 20; j++)
        {
            int cnt1 = n - j - 1;
            if (cnt1 < 0)break;
            if (cnt >= cnt1)
            {
                ans = (ans + mod - f[i][j] * cm.comb(cnt, cnt1, 1) % mod) % mod;
            }
        }
    }
    cout << ans << '\n';
}
int main()
{
    solve();
}

这程序好像有点Bug,我给组数据试试?

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 8204kb

input:

4 3

output:

7

result:

ok 1 number(s): "7"

Test #2:

score: 0
Accepted
time: 0ms
memory: 8184kb

input:

11 4

output:

1187

result:

ok 1 number(s): "1187"

Test #3:

score: 0
Accepted
time: 73ms
memory: 30336kb

input:

100000 99999

output:

17356471

result:

ok 1 number(s): "17356471"

Test #4:

score: 0
Accepted
time: 4ms
memory: 10608kb

input:

11451 1919

output:

845616153

result:

ok 1 number(s): "845616153"

Test #5:

score: 0
Accepted
time: 70ms
memory: 30444kb

input:

99998 12345

output:

936396560

result:

ok 1 number(s): "936396560"

Test #6:

score: 0
Accepted
time: 74ms
memory: 30488kb

input:

100000 1

output:

0

result:

ok 1 number(s): "0"

Test #7:

score: 0
Accepted
time: 79ms
memory: 30452kb

input:

100000 15

output:

190067060

result:

ok 1 number(s): "190067060"

Test #8:

score: 0
Accepted
time: 0ms
memory: 8284kb

input:

10 3

output:

299

result:

ok 1 number(s): "299"

Test #9:

score: 0
Accepted
time: 3ms
memory: 8276kb

input:

10 4

output:

743

result:

ok 1 number(s): "743"

Test #10:

score: 0
Accepted
time: 3ms
memory: 8288kb

input:

10 5

output:

1129

result:

ok 1 number(s): "1129"

Test #11:

score: 0
Accepted
time: 3ms
memory: 8288kb

input:

15 6

output:

28006

result:

ok 1 number(s): "28006"

Test #12:

score: 0
Accepted
time: 3ms
memory: 8276kb

input:

15 7

output:

42035

result:

ok 1 number(s): "42035"

Test #13:

score: 0
Accepted
time: 3ms
memory: 8304kb

input:

123 45

output:

214851327

result:

ok 1 number(s): "214851327"

Test #14:

score: 0
Accepted
time: 0ms
memory: 8728kb

input:

998 244

output:

964050559

result:

ok 1 number(s): "964050559"

Test #15:

score: 0
Accepted
time: 4ms
memory: 8700kb

input:

1919 810

output:

379720338

result:

ok 1 number(s): "379720338"

Test #16:

score: 0
Accepted
time: 4ms
memory: 8476kb

input:

1048 576

output:

216543264

result:

ok 1 number(s): "216543264"

Test #17:

score: 0
Accepted
time: 4ms
memory: 8720kb

input:

999 777

output:

635548531

result:

ok 1 number(s): "635548531"

Test #18:

score: 0
Accepted
time: 62ms
memory: 30460kb

input:

99999 77777

output:

448144614

result:

ok 1 number(s): "448144614"

Test #19:

score: 0
Accepted
time: 19ms
memory: 15752kb

input:

34527 6545

output:

748108997

result:

ok 1 number(s): "748108997"

Test #20:

score: 0
Accepted
time: 5ms
memory: 11008kb

input:

12345 12

output:

777496209

result:

ok 1 number(s): "777496209"

Test #21:

score: 0
Accepted
time: 3ms
memory: 8280kb

input:

1 1

output:

0

result:

ok 1 number(s): "0"

Test #22:

score: 0
Accepted
time: 73ms
memory: 30532kb

input:

100000 10101

output:

855985819

result:

ok 1 number(s): "855985819"

Test #23:

score: 0
Accepted
time: 72ms
memory: 30448kb

input:

100000 91919

output:

92446940

result:

ok 1 number(s): "92446940"

Test #24:

score: 0
Accepted
time: 75ms
memory: 30424kb

input:

100000 77979

output:

106899398

result:

ok 1 number(s): "106899398"

Test #25:

score: 0
Accepted
time: 4ms
memory: 10244kb

input:

10000 11

output:

326411649

result:

ok 1 number(s): "326411649"

Test #26:

score: 0
Accepted
time: 74ms
memory: 30552kb

input:

100000 2

output:

15322970

result:

ok 1 number(s): "15322970"

Test #27:

score: 0
Accepted
time: 64ms
memory: 30496kb

input:

100000 3

output:

93355797

result:

ok 1 number(s): "93355797"

Test #28:

score: 0
Accepted
time: 71ms
memory: 30476kb

input:

100000 99998

output:

331850772

result:

ok 1 number(s): "331850772"

Test #29:

score: 0
Accepted
time: 71ms
memory: 30404kb

input:

100000 99996

output:

885066226

result:

ok 1 number(s): "885066226"

Test #30:

score: 0
Accepted
time: 6ms
memory: 10944kb

input:

13115 2964

output:

0

result:

ok 1 number(s): "0"

Test #31:

score: 0
Accepted
time: 78ms
memory: 30376kb

input:

100000 17

output:

425792977

result:

ok 1 number(s): "425792977"

Test #32:

score: 0
Accepted
time: 68ms
memory: 30480kb

input:

99991 16

output:

667323936

result:

ok 1 number(s): "667323936"

Test #33:

score: 0
Accepted
time: 69ms
memory: 30404kb

input:

99991 17

output:

627396741

result:

ok 1 number(s): "627396741"

Test #34:

score: 0
Accepted
time: 78ms
memory: 30488kb

input:

99991 18

output:

874158501

result:

ok 1 number(s): "874158501"

Test #35:

score: 0
Accepted
time: 75ms
memory: 30544kb

input:

100000 100000

output:

99999

result:

ok 1 number(s): "99999"

Test #36:

score: 0
Accepted
time: 70ms
memory: 29092kb

input:

94229 94229

output:

94228

result:

ok 1 number(s): "94228"

Test #37:

score: 0
Accepted
time: 60ms
memory: 29096kb

input:

94229 94223

output:

476599876

result:

ok 1 number(s): "476599876"

Test #38:

score: 0
Accepted
time: 3ms
memory: 8504kb

input:

2 1

output:

0

result:

ok 1 number(s): "0"

Test #39:

score: 0
Accepted
time: 0ms
memory: 8276kb

input:

2 2

output:

0

result:

ok 1 number(s): "0"

Test #40:

score: 0
Accepted
time: 0ms
memory: 8224kb

input:

3 1

output:

0

result:

ok 1 number(s): "0"

Test #41:

score: 0
Accepted
time: 3ms
memory: 8212kb

input:

3 2

output:

2

result:

ok 1 number(s): "2"

Test #42:

score: 0
Accepted
time: 0ms
memory: 8204kb

input:

3 3

output:

2

result:

ok 1 number(s): "2"

Test #43:

score: 0
Accepted
time: 3ms
memory: 8216kb

input:

9 2

output:

44

result:

ok 1 number(s): "44"

Test #44:

score: 0
Accepted
time: 3ms
memory: 8428kb

input:

9 3

output:

206

result:

ok 1 number(s): "206"

Test #45:

score: 0
Accepted
time: 0ms
memory: 8508kb

input:

9 4

output:

441

result:

ok 1 number(s): "441"

Test #46:

score: 0
Accepted
time: 0ms
memory: 8288kb

input:

9 7

output:

224

result:

ok 1 number(s): "224"

Test #47:

score: 0
Accepted
time: 45ms
memory: 23944kb

input:

70839 22229

output:

0

result:

ok 1 number(s): "0"

Test #48:

score: 0
Accepted
time: 36ms
memory: 22580kb

input:

65536 17

output:

698801006

result:

ok 1 number(s): "698801006"

Test #49:

score: 0
Accepted
time: 40ms
memory: 22528kb

input:

65535 17

output:

433312902

result:

ok 1 number(s): "433312902"

Test #50:

score: 0
Accepted
time: 68ms
memory: 30376kb

input:

99856 317

output:

932131332

result:

ok 1 number(s): "932131332"

Test #51:

score: 0
Accepted
time: 61ms
memory: 30476kb

input:

99856 318

output:

398997854

result:

ok 1 number(s): "398997854"

Test #52:

score: 0
Accepted
time: 61ms
memory: 30480kb

input:

99856 2

output:

984791559

result:

ok 1 number(s): "984791559"

Test #53:

score: 0
Accepted
time: 62ms
memory: 30408kb

input:

100000 50000

output:

309108799

result:

ok 1 number(s): "309108799"

Extra Test:

score: 0
Extra Test Passed