oj.uz

답안 #1080089

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1080089 2024-08-29T06:53:14 Z mariza Rack (eJOI19_rack) C++14
40 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll MOD=1e9+7;

ll mpow(ll b, ll e, ll m){
    if(e==0) return 1;
    else if(e%2==0) return mpow((b*b)%m,e/2,m)%m;
    else return (b*mpow(b*b,e/2,m))%m;
}

int main(){
    ll n, k;
    cin>>n>>k; k--;

    ll ans=0;
    for(ll i=0; i<60; i++){
        if(k&(1ll<<i)) ans+=mpow(2,n-i-1,MOD);
        ans%=MOD;
        // cout<<i<<" "<<ans<<endl;
    }
    ans++;
    ans%=MOD;
    cout<<ans<<endl;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 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
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 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 0 ms 348 KB Output is correct
12 Incorrect 0 ms 348 KB Output isn't correct
13 Halted 0 ms 0 KB -