# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
467184 | 2021-08-21T23:01:35 Z | nemethm | Rack (eJOI19_rack) | C++17 | 1 ms | 204 KB |
#include <iostream> #include <list> #include <algorithm> #include <queue> #include <vector> #include <limits> #include <set> #include <numeric> #include <string> #include <assert.h> #include <map> #include <cmath> #include <stack> #include <cstring> #include <stack> #pragma warning(disable : 4996) using namespace std; using ll = long long int; const ll inf = numeric_limits<ll>::max(); //const ll mod = 1e9+7; void setIO(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); } uint64_t binpow(uint64_t base, uint64_t exp, uint64_t mod) { if (exp == 0) return 1; uint64_t half = binpow(base, exp / 2, mod); uint64_t answ = (half * half) % mod; if (exp % 2 == 1) { answ *= base; answ %= mod; } return answ; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.precision(9); uint64_t n, k, m = 1e9 + 7; cin >> n >> k; --k; uint64_t k_rev = 0; for (int i = 0; i < 64; ++i) { if ((k >> i) & 1) k_rev |= 1ull << (64 - i - 1); } if (n <= 64) { k_rev >>= (64 - n); k_rev %= m; ++k_rev; k_rev %= m; cout << k_rev << endl; } else { uint64_t twopower = binpow(2, n - 64, m); uint64_t answ = 0; for (int i = 0; i < 64; ++i) { if ((k_rev >> i) & 1) { answ += twopower; answ %= m; } twopower *= 2; twopower %= m; } ++answ; answ %= m; cout << answ << endl; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Correct | 1 ms | 204 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 1 ms | 204 KB | Output is correct |
9 | Correct | 0 ms | 204 KB | Output is correct |
10 | Correct | 1 ms | 204 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Correct | 1 ms | 204 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 1 ms | 204 KB | Output is correct |
9 | Correct | 0 ms | 204 KB | Output is correct |
10 | Correct | 1 ms | 204 KB | Output is correct |
11 | Correct | 1 ms | 204 KB | Output is correct |
12 | Correct | 0 ms | 204 KB | Output is correct |
13 | Correct | 1 ms | 204 KB | Output is correct |
14 | Correct | 0 ms | 204 KB | Output is correct |
15 | Correct | 0 ms | 204 KB | Output is correct |