QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#108125#5749. Directed Vertex CactiFISHER_AC ✓15ms3876kbC++14808b2023-05-23 17:16:532023-05-23 17:16:56

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-05-23 17:16:56]
  • 评测
  • 测评结果:AC
  • 用时:15ms
  • 内存:3876kb
  • [2023-05-23 17:16:53]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000009, inv2 = 500000005;
inline int Mod(int x) { return x + ((x >> 31) & mod); }
inline int add(int x, int y) { return Mod(x + y - mod); }
inline int sub(int x, int y) { return Mod(x - y); }
inline int mul(int x, int y) { return 1ll * x * y % mod; }
int qpow(int a, int b) {
    if (!b) return 1;
    int t = qpow(a, b >> 1);
    t = mul(t, t);
    if (b & 1) return mul(t, a);
    return t;
}
int fac(int n) {
	int rs = 1;
	for (int i = 1; i <= n; i++) rs = mul(rs, i);
	return rs;
}
int C(int m, int n) {
	int rs = qpow(fac(n), mod - 2);
	for (int i = m; i > m - n; i--) rs = mul(rs, i);
	return rs;
}
int main() {
	int n, m;
	scanf("%d%d", &n, &m);
	printf("%d", mul(fac(n), C(mul(mul(n, n - 1), inv2), m)));
}

詳細信息

Test #1:

score: 100
Accepted
time: 2ms
memory: 3872kb

input:

3 1

output:

18

result:

ok 1 number(s): "18"

Test #2:

score: 0
Accepted
time: 2ms
memory: 3640kb

input:

4 4

output:

360

result:

ok 1 number(s): "360"

Test #3:

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

input:

39847 348708

output:

983575456

result:

ok 1 number(s): "983575456"

Test #4:

score: 0
Accepted
time: 2ms
memory: 3572kb

input:

1 1

output:

0

result:

ok 1 number(s): "0"

Test #5:

score: 0
Accepted
time: 1ms
memory: 3640kb

input:

3 2

output:

18

result:

ok 1 number(s): "18"

Test #6:

score: 0
Accepted
time: 2ms
memory: 3716kb

input:

3 3

output:

6

result:

ok 1 number(s): "6"

Test #7:

score: 0
Accepted
time: 1ms
memory: 3572kb

input:

3 4

output:

0

result:

ok 1 number(s): "0"

Test #8:

score: 0
Accepted
time: 11ms
memory: 3640kb

input:

3 1000000

output:

0

result:

ok 1 number(s): "0"

Test #9:

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

input:

4 1

output:

144

result:

ok 1 number(s): "144"

Test #10:

score: 0
Accepted
time: 2ms
memory: 3576kb

input:

4 2

output:

360

result:

ok 1 number(s): "360"

Test #11:

score: 0
Accepted
time: 2ms
memory: 3568kb

input:

4 3

output:

480

result:

ok 1 number(s): "480"

Test #12:

score: 0
Accepted
time: 2ms
memory: 3568kb

input:

4 5

output:

144

result:

ok 1 number(s): "144"

Test #13:

score: 0
Accepted
time: 2ms
memory: 3640kb

input:

4 6

output:

24

result:

ok 1 number(s): "24"

Test #14:

score: 0
Accepted
time: 2ms
memory: 3684kb

input:

5 1

output:

1200

result:

ok 1 number(s): "1200"

Test #15:

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

input:

5 2

output:

5400

result:

ok 1 number(s): "5400"

Test #16:

score: 0
Accepted
time: 2ms
memory: 3688kb

input:

5 3

output:

14400

result:

ok 1 number(s): "14400"

Test #17:

score: 0
Accepted
time: 2ms
memory: 3872kb

input:

5 4

output:

25200

result:

ok 1 number(s): "25200"

Test #18:

score: 0
Accepted
time: 1ms
memory: 3636kb

input:

5 5

output:

30240

result:

ok 1 number(s): "30240"

Test #19:

score: 0
Accepted
time: 2ms
memory: 3860kb

input:

5 6

output:

25200

result:

ok 1 number(s): "25200"

Test #20:

score: 0
Accepted
time: 1ms
memory: 3712kb

input:

5 7

output:

14400

result:

ok 1 number(s): "14400"

Test #21:

score: 0
Accepted
time: 1ms
memory: 3640kb

input:

5 8

output:

5400

result:

ok 1 number(s): "5400"

Test #22:

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

input:

5 9

output:

1200

result:

ok 1 number(s): "1200"

Test #23:

score: 0
Accepted
time: 2ms
memory: 3872kb

input:

5 10

output:

120

result:

ok 1 number(s): "120"

Test #24:

score: 0
Accepted
time: 2ms
memory: 3644kb

input:

1000 1

output:

533396879

result:

ok 1 number(s): "533396879"

Test #25:

score: 0
Accepted
time: 1ms
memory: 3648kb

input:

1000 100

output:

199484478

result:

ok 1 number(s): "199484478"

Test #26:

score: 0
Accepted
time: 1ms
memory: 3820kb

input:

1000 10000

output:

656650652

result:

ok 1 number(s): "656650652"

Test #27:

score: 0
Accepted
time: 11ms
memory: 3644kb

input:

1000 1000000

output:

0

result:

ok 1 number(s): "0"

Test #28:

score: 0
Accepted
time: 10ms
memory: 3612kb

input:

535164 619302

output:

721871396

result:

ok 1 number(s): "721871396"

Test #29:

score: 0
Accepted
time: 15ms
memory: 3644kb

input:

1000000 1000000

output:

580712335

result:

ok 1 number(s): "580712335"

Test #30:

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

input:

1000000 234534

output:

546630669

result:

ok 1 number(s): "546630669"

Test #31:

score: 0
Accepted
time: 9ms
memory: 3640kb

input:

234523 1000000

output:

127869098

result:

ok 1 number(s): "127869098"

Test #32:

score: 0
Accepted
time: 1ms
memory: 3876kb

input:

44722 10000

output:

0

result:

ok 1 number(s): "0"