| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 643257 | west | Rack (eJOI19_rack) | C++14 | 9 ms | 300 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 <iostream>
using namespace std;
const int m=1e9+7;
int main()
{
int n;
long long k;
int wynik=1;
cin>>n>>k;
--k;
for(int i=1;i<=n;i++)
{
if(k%2==0)
wynik=((long long)2*wynik)%m;
else
wynik=((long long)2*wynik+1)%m;
k=k/2;
}
int p=1;
for(int i=1;i<=n;i++)
p=((long long)2*p)%m;
cout<<(wynik-(p-1)+m)%m;
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
