이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/*
ID: Sho10
LANG: C++
*/
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,k;
ll pw(ll a,ll b){
if(b==0) return 1;
ll n=pw(a,b/2);
if(b%2==1){
return (((n*n)%mod)*a)%mod;
}else return (n*n)%mod;
}
int32_t main(){
CODE_START;
cin>>n>>k;
ll ans=1,s1=1;
while(k!=1){
if(k%2==0){
ans=ans+pw(2LL,n-s1);
ans=ans%mod;
s1++;
ll val=k/2;
k=k-val;
}else {
s1++;
ll val=k/2;
k=k-val;
}
}
cout<<ans<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |