| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1188727 | mkkkkkkkk | Rack (eJOI19_rack) | C++20 | 9 ms | 8260 KiB |
#include <bits/stdc++.h>
using namespace std;
long long mod=1000000007;
long long poww[1000001];
int main()
{
long long br=1;
for(long long i=0;i<=1000000;i++,br=(br*2)%mod)
poww[i]=br;
long long n,k;
cin>>n>>k;
long long res=0;
for(long long brr=2,i=poww[n-1];n>=1;k=k/2+k%2,n--)
{
i=poww[n-1];
if(k%brr==0)
res+=i;
}
cout<<res+1;
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... | ||||
