No.3476 {2^n-1}-gon
問題文最終更新日: 2026-03-20 23:34:33
English (AI translation)
This statement was translated by AI (claude-opus-5-5, effort medium) and may contain errors or differ in nuance from the original. The original statement takes precedence.
Back to the original
yukicoder contest 494 オムニバス
(順位表)
の他の問題:
Story
Ruku-kun is a strange kid, so he is drawing a regular $2^N-1$-gon.
Problem
On the circumference of a circle centered at point $O$, $2^N - 1$ points are placed at equal intervals, and the points are numbered from $1$ to $2^N - 1$.
Among the ways to choose $M$ distinct points from these points, find the number of ways satisfying the following condition, modulo $998244353$.
- The point $O$ is contained in the interior (including the boundary) of the $M$-gon whose vertices are the chosen $M$ points.
Constraints
- $2 \le N \le 10^9$
- $3 \le M \le \min(10^6, 2^N - 1)$
- All inputs are integers
Input
The input is given from standard input in the following format.
$N\ M$
Output
Output the answer.
Sample
Sample 1
Input
3 4
Output
28
Left: a good example, Right: a bad example
Sample 2
Input
5 10
Output
44197010
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。
ぽえ