Codeforces1300(618Round Div2)

Topic
solution to a problem
EDITORIAL (whining & nonsense & Diudiu a summary):
not a good game to play himself in the end do not know how much food $.jpg$
for the first time to play $Codeforces$ on the swap $Rating$ offering
a familiar operating since the beginning of the site is too slow and, almost before the others finished two questions we have to start to do the first time to submit language did not adjust to not react stunned $THIS$ three times
the estimated refreshed $HI$ sector lower degree of error sb
$A$ problem of this difficult topic for some time wanted $（$ Front always get in the game mentality led to the collapse of the first question, when do is panic $）$ Experiencing a little bit of panic on this issue wrong to change ah Shashi Houstorm cry
$B$ title'd glance over at the conclusion of five minutes $\dots$
$C$ title to $OR$ seen $XOR$ , then the first reactor $Trie$ tree $+$ Greedy $\dots$ I did not save it, super-bit computing also grasp unfamiliar, sohappydid not do it. $C$ questions are I do not come out in the end is what super fool
As $D$ $E$ , to blame this poor English, after the game feel a bit more than a good translation $C$ questions do
sum up, spot mentality is not enough, the level of bad English, basic arithmetic operations bit unfamiliar, play a few matches to take to raise my la la la
set small goals: blue name

---

$A$ title skip

---

$B$ title skip

---

$C$ title

Anu Has a Function

This question is not difficult alignment operation inspection, are some very basic things, for the road is good Meng new questions

by observing difficult to find this function has the property: $(a|b)-b = a\&(-b)$ . So the title equation can be written as $a_1\&(\thicksim a_2)\&(\thicksim a_3)\&\dots\&(\thicksim a_{n-1})\&(\thicksim a_n)$ , Then found that factors affecting the results of only the first element $($ The results obtained later in the same sequence of exchange $)$ , So obviously: only when on a certain $1$ number of $1$ , the ability to generate a positive contribution to the answer.
Practice: enumerate each number to see if it meets the requirements, you can meet on the top surface.
Code: Note that the final output

#include <bits/stdc++.h>
using namespace std;
const int N=(int)1e6+5;
int n,a[N],ans,now,sum,vis; 
int v[N],b[N][32];
queue<int> q;
inline int read(){
	int cnt=0,f=1;char c=getchar();
	while(!isdigit(c)){if(c=='-')f=-f;c=getchar();}
	while(isdigit(c)){cnt=(cnt<<3)+(cnt<<1)+(c^48);c=getchar();}
	return cnt*f;
}
int main(){
	n=read();
	for(int i=1;i<=n;++i){
		a[i]=read();
		for(int j=0;j<=31;++j){
			b[i][j]=(a[i]>>j)&1;
		}
	}
	for(int i=31;i>=0;--i){
		sum=0;
		for(int j=1;j<=n;++j){
			if(b[j][i]&1){
				sum++;vis=j;
			}
		}
		if(sum==1&&v[vis]==0){
			q.push(a[vis]);v[vis]=1;
		}
	}
	cerr<<q.size()<<endl;
	for(int i=q.size()-1;i>=0;i--){//输出一定要注意循环变量的处理
		printf("%d ",q.front());
		q.pop(); 
	}
	for(int i=1;i<=n;i++){
		if(v[i]==0){
			printf("%d ",a[i]);
		}
	}
	return 0;
}
/*
5
809571641 29322377 935888946 833709370 2457463
answer：935888946 833709370 29322377 809571641 2457463 
*/

---

$D$ title
a topic intended: to determine whether two similar polygons
complete title poke here
the question read three times, still do not know what it requires, first of all it seems that the English need to upgrade
me how even the solution to a problem and can not read

---

$E$ title
Gugu Gu