n, p = map(int, input().split(' '))
def main(n, p):
for i in range(1, 65):
if (n - i*p > 0):
s = bin(n- i*p)[2:]
sum = 0
for j in range(len(s)):
if(s[len(s) -1 -j] == '1'):
sum += j+1
if(sum >= i and s.count('1') <= i):
return i
return -1
print(main(n, p)) ///~~~LOTA~~~///
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
#define li long int
#define ld long double
#define append push_back
#define add insert
#define nl "\n"
#define ff first
#define ss second
#define pii pair<int,int>
#define pic pair<int,char>
#define all(x) (x).begin(),(x).end()
#define sum(a) accumulate(all(a),0)
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL)
#define terminator main
#define MAXN 1001
void solve(){
int n,m,o,p,q;
cin>>n>>m;
o=1;
while(o*m<n){
if(__builtin_popcount(n-o*m)<=o && (n-o*m)>=o){
cout<<o;
return;
}
o++;
}
cout<<-1;
}
int terminator(){
L0TA;
solve();
return 0;
}672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |
515. Find Largest Value in Each Tree Row | 345. Reverse Vowels of a String |
628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |