제출 #970567

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

rack

#include <bits/stdc++.h>
#define int long long
#define sz(a) (int)a.size()
#define all(x) (x).begin(), (x).end()
using namespace std;

const int mod=1e9+7;
vector<vector<pair<int,int>>> edges;
vector<vector<pair<int,int>>> edges2;
vector<int> topo;
vector<int> ssc;
map<string,int> mp;

vector<vector<int>> circle;
vector<int> visited;
vector<int> dp;
vector<set<pair<int,int>>> contr_edges;
vector<set<pair<int,int>>> contr_edges_inv;

int MOD(int x){
    return ((x+mod)%mod);
}

int fast_pow(int x, int p){
    if(p==1) return x;
    if(p==0) return 1;
    if(p%2==0) return MOD(MOD(fast_pow(x,p/2))*MOD(fast_pow(x,p/2)));
    else return MOD(MOD(fast_pow(x,p-1))*x);
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int n,k; cin >> n>>k;
    k--;
    int sum=1;
    for (int i = 1; i <= n; i++)
    {
        if(k&(1<<(i-1))) sum=MOD(sum+fast_pow(2, (n-i)));
    }
    cout << sum << "\n";
    return 0;
}

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