#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cmath>
typedef long long ll;
using namespace std;
int main()
{
int n;
int m;
while(~scanf("%d%d",&n,&m))
{
if(n>=27)
cout<<m<<endl;
else{
int u=pow(2,n);
cout<<m%u<<endl;
}
}
return 0;
}
点击打开codeforces
#include<iostream>
#include<string.h>
using namespace std;
int main()
{
int n;
int p;
int logal;
int map[1006];
int xpp[1006];
int num;
while(cin>>n)
{
logal=0;
memset(map,0,sizeof(map));
memset(xpp,-1,sizeof(xpp));
for(int i=2;i<=n;i++)
{
cin>>p;
map[p]++;
xpp[i]=p;
}
for(int i=1;i<=n;i++)
{
if(map[i]!=0)
{
num=0;
for(int j=i+1;j<=n;j++)
{
if(xpp[j]==i&&map[j]==0)
num++;
}
if(num<3)
{
logal=111;
break;
}
}
}
if(logal==111)
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;
}
return 0;
}
和我爱的一起再接再励