913A. Modular Exponentiation(思维)

最新推荐文章于 2023-02-03 21:51:50 发布

爱上键盘的小哥哥

最新推荐文章于 2023-02-03 21:51:50 发布

阅读量239

点赞数

分类专栏： Codeforces 找规律

本文链接：https://blog.csdn.net/islittlehappy/article/details/79363567

版权

119 篇文章 0 订阅

订阅专栏

103 篇文章 0 订阅

订阅专栏

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

$\text{[math]}$ ,

where 2ⁿ = 2·2·...·2 (n factors), and $\text{[math]}$ denotes the remainder of division of x by y.

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

$\text{[math]}$ .

Input

The first line contains a single integer n (1 ≤ n ≤ 10⁸).

The second line contains a single integer m (1 ≤ m ≤ 10⁸).

Output

Output a single integer — the value of $\text{[math]}$ .

Examples

Input

Copy

4
42

Output

Input

Copy

1
58

Output

Input

Copy

98765432
23456789

Output

23456789

Note

In the first example, the remainder of division of 42 by 2⁴ = 16 is equal to 10.

In the second example, 58 is divisible by 2¹ = 2 without remainder, and the answer is 0.

题意：求m%(2^n)

思路：如果x<y x%y=x,

如果m<2^n 输出 m,否则输出m%(2^n)，m最大为100000000，而当n>27时2^n>100000000

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,m;
    scanf("%d%d",&n,&m);
    printf("%d\n",n>=31?m:m%(1<<n));
	return 0;
}

关注