A11522 | Modular Exponentiation
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
The following problem is well-known: given integers $n$ and $m$ , calculate
, where $2^{n}=2·2·...·2$ ( $n$ factors), and  denotes the remainder of division of $x$ by $y$ .
You are asked to solve the "reverse" problem. Given integers $n$ and $m$ , calculate
.
, where $2^{n}=2·2·...·2$ ( $n$ factors), and  denotes the remainder of division of $x$ by $y$ .
You are asked to solve the "reverse" problem. Given integers $n$ and $m$ , calculate
.
输入格式
The first line contains a single integer $n$ ( $1<=n<=10^{8}$ ).
The second line contains a single integer $m$ ( $1<=m<=10^{8}$ ).
The second line contains a single integer $m$ ( $1<=m<=10^{8}$ ).
输出格式
Output a single integer — the value of .
输入输出样例
输入 #1
4 42
输出 #1
10
输入 #2
1 58
输出 #2
0
输入 #3
98765432 23456789
输出 #3
23456789
In the first example, the remainder of division of 42 by $2^{4}=16$ is equal to 10.
In the second example, 58 is divisible by $2^{1}=2$ without remainder, and the answer is 0.
In the second example, 58 is divisible by $2^{1}=2$ without remainder, and the answer is 0.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted