oj.uz

답안 #1097292

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1097292 2024-10-06T17:10:08 Z vjudge1 Rack (eJOI19_rack) C++14
100 / 100
 2 ms 432 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int mod = 1e9+7;

ll mpow(ll b, ll p) {
    if (p == 0) return 1;
    ll a = mpow(b, p/2)%mod;
    if (p%2 == 0) return (a*a)%mod;
    return (((a*a)%mod)*b)%mod;
}

int main() {
    ll n, k; cin >> n >> k;
    ll ans = 0;
    for (int i = 1; i <= n; ++i) {
        if (k%2) k = (k+1)/2LL;
        else {
            k = k/2LL;
            ans += mpow(2, n-i);
            ans %= mod;
        } 
    }
    cout << (ans+1)%mod << endl;

    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
60.0 / 60.0

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