HDU 5014 异或之和

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <cctype>
#include <vector>
#include <iterator>
#include <set>
#include <map>
#include <sstream>
using namespace std;

#define mem(a,b) memset(a,b,sizeof(a))
#define pf printf
#define sf scanf
#define spf sprintf
#define pb push_back
#define debug printf("!\n")
#define MAXN 100000 + 10
#define MAX(a,b) a>b?a:b
#define blank pf("\n")
#define LL long long
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pqueue priority_queue
#define INF 0x3f3f3f3f

int n,m;

int a[MAXN],b[MAXN];

int main()
{
int i,j;
while(~sf("%d",&n))
{
mem(a,0);
mem(b,-1);
long long sum = 0;
for(i=0;i<=n;i++) sf("%d",&a[i]);
for(i=n;i>=0;i--)
{
int s = i;
if(b[i] == -1)
{
int cnt = 0;
while(s)
{
s>>=1;
cnt++;
}
int tmp = (1<<cnt) -1;
b[i] = i^tmp;
b[i^tmp] = i;
}
}
//for(i=0;i<=n;i++) pf("%d ",b[i]);
for(i=0;i<=n;i++) sum+= i^b[i];
pf("%I64d\n",sum);

for(i=0;i<n;i++)
{
pf("%d ",b[a[i]]);
}
pf("%d\n",b[a
]);

}
return 0;
}