답안 #607272

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
607272 2022-07-26T14:17:48 Z xtk Rack (eJOI19_rack) C++17
40 / 100
1 ms 308 KB
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
// #define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
const long long MOD=1e9+7;
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	long long n, k;
	cin>>n>>k;
	k--;
	long long ans=1;
	for (int i=1; i<=n; ++i) {
		if(k%2==1) {
			ans = (long long)(ans*2+1LL);
			ans = ans % MOD;
		}
		else {
			ans = (long long)(ans*2);
			ans = ans % MOD;
		}
		k/=2;
	}
	long long pow=1;
	for (int i=1; i<=n; ++i) {
		pow = (long long)(pow*2)%MOD;
	}
	pow--;
	cout<<(long long)(ans-pow)<<'\n';
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 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 0 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 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 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 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 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Incorrect 1 ms 212 KB Output isn't correct
15 Halted 0 ms 0 KB -