oj.uz

답안 #289262

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
289262 2020-09-02T13:48:00 Z FulopMate Rack (eJOI19_rack) C++14
100 / 100
 135 ms 256 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
ll mod = 1e9+7;

ll pow2(int x){
    ll r = 1;
    for(int i = 0; i < x; i++){
        r *= 2;
        r %= mod;
    }
    return r;
}

int main(){
    ll n, k; cin>>n>>k;
    ll r = 0;
    while(n > 1){
        if(k%2 == 0){
            r += pow2(n-1);
            r %= mod;
        }
        k = (k+1)/2;
        n--;
    }
    if(k == 2)r++;
    cout<<r+1;
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
60.0 / 60.0

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