oj.uz

답안 #530178

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
530178 2022-02-24T18:25:26 Z TomkeMonke Rack (eJOI19_rack) C++17
100 / 100
 10 ms 296 KB 
#include <bits/stdc++.h>
using namespace std;

const int MOD = 1e9 + 7;


int main(){

    int n;
    long long k;
    cin >> n >> k;
    k--;

    int wynik = 1;
    for(int i = 1; i <= n; i++){

        if(k%2 == 0) 
            wynik = ((long long)2 * wynik) % MOD;
        else 
            wynik = ((long long)2 * wynik + 1) % MOD;

        k /= 2;
    }

    int pow2 = 1;
    for(int i = 1; i <= n; i++) 
        pow2 = ((long long)2 * pow2) % MOD;

    cout << (wynik - (pow2 - 1) + MOD) % MOD << endl;

    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 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 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 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 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 276 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 10 ms 204 KB Output is correct