제출 #724952

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
724952		MercubytheFirst	Rack (eJOI19_rack)	C++14	40 / 100	1 ms	212 KiB

rack

#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<climits>
#include<numeric>
#include<queue>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<string.h>
#include<cmath>
#include<stack>
#define int uint64_t
using namespace std;
const int mod = 1e9 + 7;

int cdiv(int a, int b){
    return (a + b - 1ll) / b;
}

int bpow(int a, int b){
    if(a == 1 or b == 0)return 1;
    if(a == 0)return 0; // watch out for 0^0
    int ans = 1;
    a %= mod;
    while(b > 0){
        if(b&1)ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans;
} 

int inv(int x){
    return bpow(x, mod-2);
}


signed main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int n, k;
    cin >> n >> k;
    n--;
    int ans = 1, add = bpow(2,n);
    while(k > 1){
        if(!(k&1))ans = ans + add % mod;
        n--;
        add = bpow(2,n);
        k = cdiv(k,2);
    }
    cout << ans << endl;
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 0 / 60