Codeforces Round #250 (Div. 2) B. The Child and Set

B - The Child and Set

链接: B - The Child and Set.
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(10010_2) = 10_2, lowbit(10001_2) = 1_2, lowbit(10000_2) = 10000_2 (binary representation).
Can you help Picks and find any set S, that satisfies all the above conditions?

Input
The first line contains two integers: sum, limit (1 ≤ sum, limit ≤ 10^5).

Output
In the first line print an integer n (1 ≤ n ≤ 10^5), 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.
Examples
Input
5 5
Output
2
4 5
Input
4 3
Output
3
2 3 1
Input
5 1
Output
-1
Note
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.
AC code

#include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>

using namespace std;
const int N=1e6+10;
vector<int> C;
int lowbit(int x){
    return x&-x;
}

int main(){
	int n,sum,ans=0;
	scanf("%d%d",&sum,&n);
	int res=0;
	for(int i=n;i>=1;i--){
		int t=lowbit(i);
		res+=t;
		if(res == sum){
			C.push_back(i);
			ans++;
			break;
		}
		else if(res < sum){
			C.push_back(i);
			ans++;
		}
		else{
			res-=t;
		}
	}
	if(res == sum){
		printf("%d\n",ans);
		for(auto t: C) printf("%d ",t);
	}	

	else printf("-1");
	return 0;
}