题目链接:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=82662#problem/C
题目大意:
小孩子玩儿坏了我的set,我要把它重新按方法整理好:
1、set的范围在limit以内
2、set中每个元素的值等于其二进制的第一个1所对应的大小: lowbit(100102) = 102, lowbit(100012) = 12, lowbit(100002) = 100002 (binary representation).
找到元素之和等于sum的set S
位运算的题,以前一直不会位运算,虽然现在会的也不多
运算方法:lowbit(a) = a & (-a);
对数字,按lowbit之后的值从大到小进行排序,然后,小于等于sum的就加入ans数组,同时sum的值减小,如此;如果没有满足和等于sum的set存在,输出1
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 100005
struct node
{
int value;
int num;
};
bool cmp(node a, node b)
{
return a.value > b.value;
}
int main()
{
int sum, limit;
while(cin >> sum >> limit)
{
node s[N];
for(int i = 1; i <= limit; i++)
{
s[i].num = i;
s[i].value = i&(-i);
}
// for(int i = 1; i <= limit; i++)
// cout << s[i].num << " " << s[i].value << endl;
// cout <<endl;
sort(s+1,s+1+limit,cmp);
int ans = 0;
int out[N];
int k = 0;
if(s[1].value <= sum)
{
out[k++] = s[1].num;
ans += s[1].num;
}
for(int i = 2; i <= limit; i++)
if(ans+s[i].value<=sum)
{
ans += s[i].value;
//cout << " " << s[i].num;
out[k++] = s[i].num;
if(ans == sum)
break;
}
if(sum != ans)
cout << "-1" << endl;
else
{
cout << k << endl;
cout << out[0];
for(int i = 1; i < k; i++)
cout << " " << out[i];
cout << endl;
}
}
return 0;
}