제출 #1080089

#제출 시각아이디문제언어결과실행 시간메모리
1080089marizaRack (eJOI19_rack)C++14
40 / 100
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll MOD=1e9+7; ll mpow(ll b, ll e, ll m){ if(e==0) return 1; else if(e%2==0) return mpow((b*b)%m,e/2,m)%m; else return (b*mpow(b*b,e/2,m))%m; } int main(){ ll n, k; cin>>n>>k; k--; ll ans=0; for(ll i=0; i<60; i++){ if(k&(1ll<<i)) ans+=mpow(2,n-i-1,MOD); ans%=MOD; // cout<<i<<" "<<ans<<endl; } ans++; ans%=MOD; cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...