oj.uz

Submission #875606

# Submission time Handle Problem Language Result Execution time Memory
875606 2023-11-20T07:14:50 Z mariza Rack (eJOI19_rack) C++14
0 / 100
 0 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;

//i/o optimisations
#define endl "\n"
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

//data types & structures
typedef long long ll;
#define pq priority_queue

//graph structures
typedef vector<pair<ll,ll>> graph;
typedef vector<ll> nw_graph;
typedef pq<pair<ll,ll>> dij_q;

//constant values
const ll N=2e5+1;
const ll N6=1e6+1;
const ll INF=1e9+1;
const ll LOGN=18;
const ll MOD=1e9+7;

//operations
#define MID ((l+r)/2)
#define RANGE (r-l+1)

//pairs
#define f first
#define s second

//output
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;

int main(){
    fastio;

    ll n, k;
    cin>>n>>k; k--;

    ll ans=1;
    for(ll i=0; i<64; i++){
        if(k&1<<i){
            ans+=1<<(n-i-1); ans%=MOD;
        }
    }

    cout<<ans%MOD;

    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -