oj.uz

답안 #592477

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
592477 2022-07-09T08:48:05 Z Iwanttobreakfree Rack (eJOI19_rack) C++
100 / 100
 1 ms 368 KB 
#include <iostream>
#include <vector>
using namespace std;
#define int long long
const int mod=1e9+7;
int bin_exp(int n,int k){
    if(!k)return 1;
    int x=bin_exp(n,k/2);
    x=(x*x)%mod;
    if(k&1)return (x*n)%mod;
    return x;
}
signed main(){
    int n,x,cnt=1,ans=0;
    cin>>n>>x;
    x--;
    while(x){
        if(x&1)ans=(ans+bin_exp(2,n-cnt))%mod;
        x/=2;
        cnt++;
    }
    cout<<ans+1<<'\n';
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
60.0 / 60.0

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