xor - المسألة

#5376. xor

الإحصائيات

تم استخدام هذه المسألة في المسابقات التالية:

北大集训 2019 Day 4（CTT 2019 Day 4）

给定 $n, d$，计算

$$\mathrm{ans} = \sum_{0 \leq x,y,z < n} (x \oplus y \oplus z)^d \bmod{998\,244\,353}$$

输入格式

两个整数 $n, d$。

输出格式

输出整数 $\mathrm{ans}$。

样例数据

样例输入

10 3

样例输出

子任务

对于子任务 1（$10\%$）：$0 < n \leq 300$，$d \leq 3$。

对于子任务 2（$10\%$）：$0 < n \leq 5\,000$，$d \leq 3$。

对于子任务 3（$20\%$）：$0 < n \leq 10^5$，$d \leq 3$。

对于子任务 4（$20\%$）：$0 < n \leq 2^{30}$，$d \leq 3$。

对于子任务 5（$20\%$）：$0 < n \leq 2^{30}$，$d \leq 10$。

对于子任务 6（$20\%$）：$0 < n \leq 2^{30}$，$d \leq 10^5$。

About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
Issues must be filed in English or Chinese only.
Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0