QOJ.ac

QOJ

Time Limit: 1.0 s Memory Limit: 512 MB Total points: 100

#15161. PC3

Statistics

你需要统计满足以下条件的整数 $x$ 的个数:

  • $L \le x \le R$
  • $l \le x \bmod p \le r$
  • $\text{popcount}(x) = 3$

其中 $\text{popcount}(x)$ 表示 $x$ 的二进制表示中 $1$ 的个数。

由于答案可能很大,请输出其对 $998244353$ 取模后的结果。

输入格式

前两行分别是 $L$ 和 $R$ 的二进制表示($1 \le L \le R \le 2^{100000}$)。

第三行包含三个整数 $p, l, r$($0 \le l \le r < p \le 10^5$)。

输出格式

输出一个整数,表示答案对 $998244353$ 取模后的结果。

样例

输入样例 1

10
1111
7 0 4

输出样例 1

3

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.