제출 #1151172

#제출 시각아이디문제언어결과실행 시간메모리
1151172yamtllqRack (eJOI19_rack)C++20
100 / 100
5 ms4168 KiB
#include <bits/stdc++.h> using namespace std; int n; const int mod = 1e9 + 7; long long k; int arr[1000001]; int main(){ cin >> n >> k;//n <= 1e6, k <= 1e18 arr[0] = 1; for (int i = 1; i <= n; i++){ arr[i] = (arr[i - 1] * 2) % mod;//n } int ans = 0; while (k > 1){ int p = 0; long long s = 1; while (s * 2 < k){ s *= 2; p++; } ans = (ans + arr[n - p - 1]) % mod; k -= s; } cout << (ans + 1) % mod; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...