QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#759491#9553. The Hermitmango09AC ✓1004ms83672kbC++142.3kb2024-11-18 09:14:262024-11-18 09:14:26

Judging History

你现在查看的是测评时间为 2024-11-18 09:14:26 的历史记录

  • [2024-11-18 19:52:30]
  • 自动重测本题所有获得100分的提交记录
  • 测评结果:AC
  • 用时:1808ms
  • 内存:83660kb
  • [2024-11-18 19:43:48]
  • hack成功,自动添加数据
  • (/hack/1196)
  • [2024-11-18 09:14:26]
  • 评测
  • 测评结果:100
  • 用时:1004ms
  • 内存:83672kb
  • [2024-11-18 09:14:26]
  • 提交

answer

// Ice cream? I scream! 
#include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
	#define freopen Chitanda
#endif
#define wjy namespace
#define xsy std
typedef long long ll;
typedef unsigned long long ull;
using wjy xsy;

template<typename T> void debug(string s, T x) {cerr << " " << s << " = " << x << " \n";}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {for (int i = 0, b = 0; i < (int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++;else if (s[i] == ')' || s[i] == '}') b--;else if (s[i] == ',' && b == 0) {cerr << " " << s.substr(0, i) << " = " << x << " |";debug(s.substr(s.find_first_not_of(' ', i + 1)), args...);break;}}
#ifdef ONLINE_JUDGE
	#define Debug(...)
#else
	#define Debug(...) debug(#__VA_ARGS__, __VA_ARGS__)
#endif

const int MAXN = 1e5 + 5;
const int MOD = 998244353;
int Qpow(int a, int b) {int base = a, ans = 1; while (b) {if (b & 1) ans = 1ll * ans * base % MOD; base = 1ll * base * base % MOD; b >>= 1;} return ans;}
int Inv(int a) {return Qpow(a, MOD - 2);}

int fac[MAXN], ifac[MAXN];

void Init(int n)
{
	fac[0] = 1;
	for (int i = 1; i <= n; i++)
		fac[i] = 1ll * fac[i - 1] * i % MOD;
	ifac[n] = Inv(fac[n]);
	for (int i = n - 1; ~i; i--)
		ifac[i] = 1ll * ifac[i + 1] * (i + 1) % MOD;
}

int C(int n, int m)
{
	if (n < m)
		return 0;
	return 1ll * fac[n] * ifac[n - m] % MOD * ifac[m] % MOD;
}

int m, n, cnt;
int d[MAXN];

unordered_map<ull, int> f;

ull Hash(int x, int y)
{
	return ((ull)x << 32) | (ull)y;
}

int main()
{
	scanf("%d%d", &m, &n);
	// if (n == 1)
	// 	return puts("0"), 0;
	// if (n == 15)
	// 	return puts("190067060"), 0;
	Init(m);
	int ans = 1ll * n * C(m, n) % MOD, tot = 0;
	// Debug(C(m, n), ans);
	for (int i = 1; i <= m; i++)
	{
		f[Hash(i, 1)] = 1;
		for (int k = 2; i * k <= m; k++)
			for (int j = 1; j <= min(n, (int)floor(log2(i)) + 1); j++)
				f[Hash(i * k, j + 1)] = (f[Hash(i * k, j + 1)] + f[Hash(i, j)]) % MOD;
	}
	for (int i = 1; i <= m; i++)
	{
		for (int j = 1; j <= min(n, (int)floor(log2(i)) + 1); j++)
		{
			// Debug(i, j, f[{i, j}]);
			tot = (tot + 1ll * f[Hash(i, j)] * C((m / i) - 1, n - j) % MOD) % MOD;
		}
	}
	// Debug(tot);
	// tot = (tot + 1ll * (n - 1) * cnt % MOD) % MOD;
	printf("%d\n", (ans - tot + MOD) % MOD);
	return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

4 3

output:

7

result:

ok 1 number(s): "7"

Test #2:

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

input:

11 4

output:

1187

result:

ok 1 number(s): "1187"

Test #3:

score: 0
Accepted
time: 930ms
memory: 83412kb

input:

100000 99999

output:

17356471

result:

ok 1 number(s): "17356471"

Test #4:

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

input:

11451 1919

output:

845616153

result:

ok 1 number(s): "845616153"

Test #5:

score: 0
Accepted
time: 917ms
memory: 83520kb

input:

99998 12345

output:

936396560

result:

ok 1 number(s): "936396560"

Test #6:

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

input:

100000 1

output:

0

result:

ok 1 number(s): "0"

Test #7:

score: 0
Accepted
time: 921ms
memory: 83616kb

input:

100000 15

output:

190067060

result:

ok 1 number(s): "190067060"

Test #8:

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

input:

10 3

output:

299

result:

ok 1 number(s): "299"

Test #9:

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

input:

10 4

output:

743

result:

ok 1 number(s): "743"

Test #10:

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

input:

10 5

output:

1129

result:

ok 1 number(s): "1129"

Test #11:

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

input:

15 6

output:

28006

result:

ok 1 number(s): "28006"

Test #12:

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

input:

15 7

output:

42035

result:

ok 1 number(s): "42035"

Test #13:

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

input:

123 45

output:

214851327

result:

ok 1 number(s): "214851327"

Test #14:

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

input:

998 244

output:

964050559

result:

ok 1 number(s): "964050559"

Test #15:

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

input:

1919 810

output:

379720338

result:

ok 1 number(s): "379720338"

Test #16:

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

input:

1048 576

output:

216543264

result:

ok 1 number(s): "216543264"

Test #17:

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

input:

999 777

output:

635548531

result:

ok 1 number(s): "635548531"

Test #18:

score: 0
Accepted
time: 900ms
memory: 83660kb

input:

99999 77777

output:

448144614

result:

ok 1 number(s): "448144614"

Test #19:

score: 0
Accepted
time: 138ms
memory: 24472kb

input:

34527 6545

output:

748108997

result:

ok 1 number(s): "748108997"

Test #20:

score: 0
Accepted
time: 34ms
memory: 9484kb

input:

12345 12

output:

777496209

result:

ok 1 number(s): "777496209"

Test #21:

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

input:

1 1

output:

0

result:

ok 1 number(s): "0"

Test #22:

score: 0
Accepted
time: 979ms
memory: 83484kb

input:

100000 10101

output:

855985819

result:

ok 1 number(s): "855985819"

Test #23:

score: 0
Accepted
time: 927ms
memory: 83472kb

input:

100000 91919

output:

92446940

result:

ok 1 number(s): "92446940"

Test #24:

score: 0
Accepted
time: 920ms
memory: 83672kb

input:

100000 77979

output:

106899398

result:

ok 1 number(s): "106899398"

Test #25:

score: 0
Accepted
time: 29ms
memory: 8164kb

input:

10000 11

output:

326411649

result:

ok 1 number(s): "326411649"

Test #26:

score: 0
Accepted
time: 137ms
memory: 15704kb

input:

100000 2

output:

15322970

result:

ok 1 number(s): "15322970"

Test #27:

score: 0
Accepted
time: 202ms
memory: 23208kb

input:

100000 3

output:

93355797

result:

ok 1 number(s): "93355797"

Test #28:

score: 0
Accepted
time: 936ms
memory: 83664kb

input:

100000 99998

output:

331850772

result:

ok 1 number(s): "331850772"

Test #29:

score: 0
Accepted
time: 991ms
memory: 83624kb

input:

100000 99996

output:

885066226

result:

ok 1 number(s): "885066226"

Test #30:

score: 0
Accepted
time: 33ms
memory: 9964kb

input:

13115 2964

output:

0

result:

ok 1 number(s): "0"

Test #31:

score: 0
Accepted
time: 942ms
memory: 83572kb

input:

100000 17

output:

425792977

result:

ok 1 number(s): "425792977"

Test #32:

score: 0
Accepted
time: 956ms
memory: 83420kb

input:

99991 16

output:

667323936

result:

ok 1 number(s): "667323936"

Test #33:

score: 0
Accepted
time: 934ms
memory: 83588kb

input:

99991 17

output:

627396741

result:

ok 1 number(s): "627396741"

Test #34:

score: 0
Accepted
time: 946ms
memory: 83668kb

input:

99991 18

output:

874158501

result:

ok 1 number(s): "874158501"

Test #35:

score: 0
Accepted
time: 1004ms
memory: 83468kb

input:

100000 100000

output:

99999

result:

ok 1 number(s): "99999"

Test #36:

score: 0
Accepted
time: 916ms
memory: 83604kb

input:

94229 94229

output:

94228

result:

ok 1 number(s): "94228"

Test #37:

score: 0
Accepted
time: 885ms
memory: 83328kb

input:

94229 94223

output:

476599876

result:

ok 1 number(s): "476599876"

Test #38:

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

input:

2 1

output:

0

result:

ok 1 number(s): "0"

Test #39:

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

input:

2 2

output:

0

result:

ok 1 number(s): "0"

Test #40:

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

input:

3 1

output:

0

result:

ok 1 number(s): "0"

Test #41:

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

input:

3 2

output:

2

result:

ok 1 number(s): "2"

Test #42:

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

input:

3 3

output:

2

result:

ok 1 number(s): "2"

Test #43:

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

input:

9 2

output:

44

result:

ok 1 number(s): "44"

Test #44:

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

input:

9 3

output:

206

result:

ok 1 number(s): "206"

Test #45:

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

input:

9 4

output:

441

result:

ok 1 number(s): "441"

Test #46:

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

input:

9 7

output:

224

result:

ok 1 number(s): "224"

Test #47:

score: 0
Accepted
time: 511ms
memory: 48592kb

input:

70839 22229

output:

0

result:

ok 1 number(s): "0"

Test #48:

score: 0
Accepted
time: 453ms
memory: 46064kb

input:

65536 17

output:

698801006

result:

ok 1 number(s): "698801006"

Test #49:

score: 0
Accepted
time: 442ms
memory: 46012kb

input:

65535 17

output:

433312902

result:

ok 1 number(s): "433312902"

Test #50:

score: 0
Accepted
time: 943ms
memory: 83644kb

input:

99856 317

output:

932131332

result:

ok 1 number(s): "932131332"

Test #51:

score: 0
Accepted
time: 969ms
memory: 83544kb

input:

99856 318

output:

398997854

result:

ok 1 number(s): "398997854"

Test #52:

score: 0
Accepted
time: 129ms
memory: 15764kb

input:

99856 2

output:

984791559

result:

ok 1 number(s): "984791559"

Test #53:

score: 0
Accepted
time: 965ms
memory: 83464kb

input:

100000 50000

output:

309108799

result:

ok 1 number(s): "309108799"

Extra Test:

score: 0
Extra Test Passed