题目1256:找出两个只出现了一次的数字
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) {
new Task().solve() ;
}
}
class Task{
InputReader in = new InputReader(System.in) ;
PrintWriter out = new PrintWriter(System.out) ;
void solve(){
while(in.hasNext()){
int n = in.nextInt() ;
int[] num = new int[n] ;
for(int i = 0 ; i < n ; i++) num[i] = in.nextInt() ;
int targe = 0 ;
for(int i = 0 ; i < n ; i++) targe ^= num[i] ; //targe=x^y
targe &= (-targe) ; //取targe低位
int x = 0 , y = 0 ;
for(int i = 0 ; i < n ; i++){
if((num[i] & targe) > 0) x ^= num[i] ;
else y ^= num[i] ;
}
if(x > y){
int t = x ;
x = y ;
y = t ;
}
out.println(x + " " + y);
//out.flush();
}
out.flush();
}
}
class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = new StringTokenizer("");
}
private void eat(String s) {
tokenizer = new StringTokenizer(s);
}
public String nextLine() {
try {
return reader.readLine();
} catch (Exception e) {
return null;
}
}
public boolean hasNext() {
while (!tokenizer.hasMoreTokens()) {
String s = nextLine();
if (s == null)
return false;
eat(s);
}
return true;
}
public String next() {
hasNext();
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public BigInteger nextBigInteger() {
return new BigInteger(next());
}
}