# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
289494 |
2020-09-02T17:06:28 Z |
wdjpng |
Rack (eJOI19_rack) |
C++17 |
|
1 ms |
256 KB |
#include <bits/stdc++.h>
#define rep(i, n, a) for (int i = a; i < n; i++)
#define lint long long
using namespace std;
const int MOD = 1e9+7;
signed main()
{
int n, k;
cin >> n >> k;
int res=0;
vector<int>bits(n);
bits[0]=1;
rep(i, n, 1){
bits[i]=bits[i-1]*2;
bits[i]%=MOD;
}
rep(i, n, 0){
if((k>>i)&&i){
res+=bits[n-i];
res%=MOD;
}
}
cout << res + 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |