제출 #1099205

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1099205		vjudge1	Rack (eJOI19_rack)	C++17	40 / 100	0 ms	348 KiB

rack

#include <algorithm>
#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <vector>

using namespace std;
const long long mod = 1e9+7;

int binary_exponentiation(int number, int exponent)
{
    int result = 1;
    while (exponent > 0) {

        if(exponent & 1) result = result * number;

        number = number * number;
        exponent >>= 1;
    }

    return result;
}


int make_path(long long seed, int length) 
{
    long long path = 0;
    for (int i = 0; i < min(length, 62); i++) {
        if (((seed >> i) & 1) == 1) path = (path + binary_exponentiation(2, length - i - 1))%mod;
    }
    return path;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    long long int height, node;
    cin >> height >> node;
    cout << (make_path(node - 1, height) + 1)%mod << endl;
    return 0;
}

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