답안 #581040

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
581040 2022-06-22T08:43:39 Z vanea Rack (eJOI19_rack) C++14
40 / 100
1 ms 212 KB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
const int mod = 1e9+7;

ll power(int x, int y)
{
    ll temp;
    if(y == 0)
        return 1;
    temp = power(x, y / 2);
    if (y % 2 == 0)
        return temp * temp;
    else {
        if(y > 0)
            return x * temp * temp;
        else
            return (temp * temp) / x;
    }
}

int main()
{
    ll n, k;
    cin >> n >> k;
    if(k == 1) {
        cout << 1;
        return 0;
    }
    ll ans = 1;
    for(int i = n-1; i >= 0; i--) {
        if(k % 2 == 1) {
            k = k / 2 + 1;
        }
        else {
            k /= 2;
            ans += power(2, i);
            ans %= mod;
        }
    }
    cout << ans;
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -