# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
833613 | 2023-08-22T07:09:14 Z | tolbi | Rack (eJOI19_rack) | C++17 | 1 ms | 300 KB |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9+7; #define tol(bi) (1LL<<((int)(bi))) int solve(int n, long long k){ if (n>64 || k>tol(n-1)){ return ((long long)solve(n-1,k)*2ll)%MOD; } else { if (k==1){ return 1ll; } int nek = k/2; if (k%2){ return solve(n-1,k/2+1); } else { return (solve(n-1,k/2)+tol(n-1))%MOD; } } } int main(){ long long n,k; cin>>n>>k; cout<<solve(n,k)<<endl; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 300 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Incorrect | 0 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 300 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Incorrect | 0 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 300 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Incorrect | 0 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |