QOJ.ac

QOJ

時間限制: 4 s 記憶體限制: 256 MB 總分: 100

#959. Kelipatan?

统计

Diberikan sebuah bilangan bulat $n$, sebuah barisan disebut baik jika elemen-elemennya berasal dari $[1,n]$ dan semua subsekuens tidak kosongnya (tidak harus berurutan) memiliki jumlah yang tidak habis dibagi $n$.

Hitung banyaknya barisan baik sepanjang $n-k$ modulo $998\,244\,353$.

Masukan

Satu-satunya baris masukan berisi dua bilangan bulat $n,k$ ($1 \le k \le n/4 < n < 998\,244\,353$).

Keluaran

Cetak satu bilangan — jawaban untuk soal ini.

Contoh

Masukan 1

4 1

Keluaran 1

2

Masukan 2

9 2

Keluaran 2

48

Masukan 3

222222222 222222

Keluaran 3

851798824

Editorials

IDTypeStatusTitlePosted ByLast UpdatedActions
#319EditorialOpen题解jianglyView

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.