Submission #1220595

#TimeUsernameProblemLanguageResultExecution timeMemory
1220595durdonaRack (eJOI19_rack)C++20
40 / 100
0 ms328 KiB
#include <iostream> #include <cmath> const int mod = 1e9 + 7; long long rec(int i, int j) { if (i == 0) return 1; if (j % 2 == 0) { return (rec(i - 1, j / 2) + static_cast<long long>(pow(2, i - 1)) % mod) % mod; } else { return rec(i - 1, j / 2 + 1); } } int main() { int n, k; std::cin >> n >> k; std::cout << rec(n, k) << std::endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...