At the children's day, the child came to Picks's house, and messed his house up. Picks was angry at him. A lot of important things were lost, in particular the favorite set of Picks.
Fortunately, Picks remembers something about his set S:
- its elements were distinct integers from 1 to limit;
- the value of
was equal to sum; here lowbit(x) equals 2k where k is the position of the first one in the binary representation of x. For example, lowbit(100102) = 102, lowbit(100012) = 12, lowbit(100002) = 100002 (binary representation).
Can you help Picks and find any set S, that satisfies all the above conditions?
The first line contains two integers: sum, limit (1 ≤ sum, limit ≤ 105).
In the first line print an integer n (1 ≤ n ≤ 105), denoting the size of S. Then print the elements of set S in any order. If there are multiple answers, print any of them.
If it's impossible to find a suitable set, print -1.
5 5
2 4 5
4 3
3 2 3 1
5 1
-1
In sample test 1: lowbit(4) = 4, lowbit(5) = 1, 4 + 1 = 5.
In sample test 2: lowbit(1) = 1, lowbit(2) = 2, lowbit(3) = 1, 1 + 2 + 1 = 4.
思路:从limit开始枚举到1找出能被sum减去的lowbit sum值减去lowbit 并且把lowbit对应的i值存入数组a, 看最后sum是否为0 ,是的话就输出数组a 其他输出-1,
一个数x的lowbit等于 x&(-x);
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int a[100006];
int getlowbit(int x){
return x&(-x);
}
int main(){
int sum,limit;
int i,k,j;
while(scanf("%d %d",&sum,&limit)!=EOF){
j=0;
memset(a,0,sizeof(a));
for(i=limit;i>=1;i--){
k=getlowbit(i);
if(sum>=k){
a[j++]=i;
sum-=k;
}
}
if(sum==0){
printf("%d\n",j);
for(i=0;i<j-1;i++)
printf("%d ",a[i]);
printf("%d\n",a[i]);
}else{
printf("-1\n");
}
}
return 0;
}