题库练习 Modular Exponentiation
← 上一题 下一题 →

A11522 | Modular Exponentiation

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

The following problem is well-known: given integers $n$ and $m$ , calculate

![](/uploads/luogu/CF913A/73fb55a49ff8c4211b34696969c8aef5090c1d6d_979c8b97a34b.png), where $2^{n}=2·2·...·2$ ( $n$ factors), and ![](/uploads/acgo/image/39872ca115187a18_df3bc425736d.jpeg) denotes the remainder of division of $x$ by $y$ .

You are asked to solve the "reverse" problem. Given integers $n$ and $m$ , calculate

![](/uploads/acgo/image/1e838ed5e2166ada_0e1a3722e280.jpeg).

输入格式

The first line contains a single integer $n$ ( $1<=n<=10^{8}$ ).

The second line contains a single integer $m$ ( $1<=m<=10^{8}$ ).

输出格式

Output a single integer — the value of ![](/uploads/acgo/image/a4fad187b4d8ec57_4c0c5d3d34e3.jpeg).

输入输出样例

输入 #1
4
42
输出 #1
10
输入 #2
1
58
输出 #2
0
输入 #3
98765432
23456789
输出 #3
23456789
C++ 编辑器
输入
输出