oj.uz

답안 #581044

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
581044 2022-06-22T08:45:06 Z Banan Rack (eJOI19_rack) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define double long double
#define endl '\n'
#define sz size
#define pb push_back
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
int const INF = LONG_LONG_MAX;
int const mod = 1e9 + 7;

int n, k;

int bp(int x)
{
    int res=1, a=2;
    while(x)
    {
        if(x&1)res*=a;
        res%=mod;
        a*=a;
        a%=mod;
        x>>=1;
    }
    return res%mod;
}

void solve()
{
    cin>>n>>k;
    int ans=0;
    int val=bp(n-1);
    while(k)
    {
        if(k%2==0){ans+=val;}else{ans++;}
        ans%=mod;
        k/=2;
        val/=2;
    }
    cout<<ans<<endl;
}

int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int tc=1;
    //cin>>tc;
    while(tc--)
    {
        solve();
    }
    return 0;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -