This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mid (start+end)/2
#define mod 1000000007
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);
int dizi[1000005];
int32_t main(){
faster
int n,m,tut=0;cin>>n>>m;
m--;
while(m>0){
dizi[tut]=m%2;
tut++;
m/=2;
//cout<<"fe"<<'\n';
}
for(int i=tut;i<=n;i++){
dizi[i]=0;
}
int cev=0;
//for(int i=0;i<n;i++)cout<<dizi[i]<<" ";
int k=n-1;
for(int i=0;i<n;i++){
if(dizi[i])cev+=1<<k;
cev%=mod;
k--;
}
cout<<cev+1<<'\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |