oj.uz

답안 #446746

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
446746 2021-07-23T07:56:26 Z osmanallazov Rack (eJOI19_rack) C++14
100 / 100
 10 ms 7904 KB 
#include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
using namespace std;
int main()
{
    ll n,k;
    cin>>n>>k;
    ll a[n+1];
    a[0]=1;
    for(int i=1;i<=n;i++){
        a[i]=a[i-1]*2%mod;
    }
    ll res=0;
    while(n!=0){
        if(k%2==0){
            res=(res+a[n-1])%mod;
        }
        n--;
        k=(k+1)/2;
    }
    cout<<(res+1)%mod;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 716 KB Output is correct
15 Correct 10 ms 7904 KB Output is correct