Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <map>
- #include <set>
- #include <queue>
- #include <algorithm>
- #include <string>
- #include <cmath>
- #include <cstdio>
- #include <iomanip>
- #include <fstream>
- #include <cassert>
- #include <cstring>
- #include <unordered_set>
- #include <unordered_map>
- #include <numeric>
- #include <ctime>
- #include <bitset>
- #include <complex>
- #include <random>
- using namespace std;
- #define int long long
- int n;
- int cnt(int x) {
- int ans = 0;
- int move = 0;
- // while (x % 2 == 0 && x > 2) {
- // x >>= 1;
- // }
- int tx = x;
- while (x <= n) {
- int ebn = n;
- for (int i = 4; i >= 0; i--) {
- if ((x >> i) & 1LL) {
- break;
- }
- if ((ebn >> i) & 1LL) {
- if (x <= ebn - (1LL << i)) {
- ebn ^= (1LL << i);
- }
- }
- }
- ans += max((int)0, min(1LL << move, ebn - x + 1));
- x <<= 1;
- move++;
- }
- if (tx % 2 == 0) {
- x = tx + 1;
- ans += cnt(tx + 1);
- }
- return ans;
- }
- signed main() {
- ios_base::sync_with_stdio(false);
- cin.tie(0);
- //BACK IN 92
- //8 + 2 + 1
- int k;
- cin >> n >> k;
- // for (int i = 1; i <= n; i++) {
- // cout << cnt(i) << ' ';
- // }
- // cout << endl;
- cout << cnt(3) << endl;
- // int r = n;
- // int l = 1;
- // while (r - l > 1) {
- // int m = (r + l) >> 1;
- // if (cnt(m) >= k) {
- // l = m;
- // } else {
- // r = m;
- // }
- // }
- // cout << l << endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement