| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1344657 | uranhishig | Rack (eJOI19_rack) | C++20 | 1 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9+7;
int run(int n, int k) {
if (n == 0) return 1;
int x = (1 << (n-1))%mod;
if (k <= x) {
return (run(n-1, k) * 2 - 1)%mod;
}
else {
return (run(n-1, k - x) * 2)%mod;
}
}
signed main() {
int n, k;
cin >> n >> k;
cout << run(n, k)%mod;
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
