2024牛客暑期多校训练营1 A Bit Common

最新推荐文章于 2025-04-03 19:48:35 发布

yaha_yaho

最新推荐文章于 2025-04-03 19:48:35 发布

阅读量989

点赞数 21

文章标签：算法

本文链接：https://blog.csdn.net/2302_80683217/article/details/140477407

版权

2024牛客暑期多校训练营1 A Bit Common

链接：登录—专业IT笔试面试备考平台_牛客网
来源：牛客网

题目描述

Given two integers nnn and mmm, among all the sequences containing n non-negative integers less than $2^{m}$ , you need to count the number of such sequences A that there exists a non-empty subsequence of A in which the bitwise AND of the integers is 1.

Note that a non-empty subsequence of a sequence A is a non-empty sequence that can be obtained by deleting zero or more elements from A and arranging the remaining elements in their original order.

Since the answer may be very large, output it modulo a positive integer q.