| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1099544 | vjudge1 | Rack (eJOI19_rack) | C++17 | 8 ms | 8028 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
string abc = "abcdefghijklmnopqrstuvwxyz";
#define int long long
signed main(){
int mod = 1e9+7;
int n, k;
cin >> n >> k;
int ans = 0;
vector<int> v(n);
v[0]=1;
for(int i = 1; i < n; i++){
v[i]=(v[i-1]*2)%mod;
}
int aux = 1;
for(int i = 0; i < min(n, (int) 63); i++){
if((k-1)&aux){
ans+=v[n-i-1];
ans%=mod;
}
aux*=2;
}
cout << (ans+1)%mod << endl;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
