Codeforces Round #596 (Div. 2)C. p-binary

Codeforces Round #596 (Div. 2)C. p-binary

http://codeforces.com/contest/1247/problem/C

题意：给出一个n,p,找到最小的需要的数字m，使得
$(2^{a_1}+p)+(2^{a_2}+p)+\dots \dots (2^{a_m}+p)=n$

做法：把m从小到大枚举，m越小越好且不会超过很大的数字，那么问题就转化为了：$2^{a_1}+2^{a_2}+\dots \dots 2^{a_m}=n-mp$，将$n-mp$转化为二进制后，每一个是1的位可以对应一个$2^{a_i}$，也可以对应很多个，例如：4可以转化(1~4)个数字的和，即4,2+2,2+1+1,1+1+1+1，所以只要让二进制中1的个数<=m，如果m>二进制中1的个数，就无法逆推回去

AC代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<queue>
#include<map>
#define ll long long
#define pb push_back
#define rep(x,a,b) for (int x=a;x<=b;x++)
#define repp(x,a,b) for (int x=a;x<b;x++)
#define W(x) printf("%d\n",x)
#define WW(x) printf("%lld\n",x)
#define pi 3.14159265358979323846
#define mem(a,x) memset(a,x,sizeof a)
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
const int maxn=2e6+7;
const int INF=1e9;
const ll INFF=1e18;
ll f(ll x){return __builtin_popcount(x);}
int main()
{
    ll n,p;
    cin>>n>>p;
    for (int i=1;i<=10000;i++)
    {
        ll x=n-i*p;
        if (f(x)<=i&&x>=i)
        {
            cout<<i<<endl;
            return 0;
        }
    }
    cout<<-1<<endl;
    return 0;
}