Codeforces Round #618 (Div. 2)-C. Anu Has a Function


Anu has created her own function f: f(x,y)=(x|y)−y where | denotes the bitwise OR operation. For example, f(11,6)=(11|6)−6=15−6=9. It can be proved that for any nonnegative numbers x and y value of f(x,y) is also nonnegative.She would like to research more about this function and has created multiple problems for herself. But she isn't able to solve all of them and needs your help. Here is one of these problems.A value of an array [a1,a2,…,an] is defined as f(f(…f(f(a1,a2),a3),…an−1),an) (see notes). You are given an array with not necessarily distinct elements. How should you reorder its elements so that the value of the array is maximal possible?

Input

The first line contains a single integer n (1≤n≤105).The second line contains n integers a1,a2,…,an (0≤ai≤109). Elements of the array are not guaranteed to be different.Output
Output n integers, the reordering of the array with maximum value. If there are multiple answers, print any.

Examples
inputCopy

4
4 0 11 6

outputCopy

11 6 4 0

inputCopy

1
13

outputCopy

Note

In the first testcase, value of the array [11,6,4,0] is f(f(f(11,6),4),0)=f(f(9,4),0)=f(9,0)=9.
[11,4,0,6] is also a valid answer.

我们把a|b-b换成 a-a&b，也就是说使得a&b最小，那我们考虑什么时候最大，即所有数的最高位，只有一个为1不然一定在运算的过程中被削去，那么这个题就可以改成，在32位中找某一位只有一个数是1的那一个数，让他当第一。因为其余都会抵消。如果不存在，那么怎样输出都是0

#include <bits/stdc++.h>
using namespace std;
const int N = 100003;
int n, a[N];
int main()
{cin >> n;for (int i = 1; i <= n; ++i){cin >> a[i];}for (int j = 30; ~j; --j){int cnt = 0, p;for (int i = 1; i <= n; ++i)if ((a[i] >> j) & 1)++cnt, p = i;if (cnt == 1){printf("%d ", a[p]);for (int k = 1; k <= n; ++k)if (k != p)printf("%d ", a[k]);return 0;}}cout<<endl<<endl;for (int i = 1; i <= n; ++i)printf("%d ", a[i]);
}

Codeforces Round #618 (Div. 2)-C. Anu Has a Function相关推荐

Codeforces Round #618 (Div. 1)-----A. Anu Has a Function
提示: Codeforces Round #618 (Div. 1)-----A. Anu Has a Function 题意: 定义一个函数f(x , y) = f(x | y) - y 给定一个长 ...
【Codeforces Round#618 (Div. 2)】C. Anu Has a Function 题解
题目链接:C. Anu Has a Function 题目 Anu has created her own function f: f(x,y)=(x|y)−y where | denotes the ...
寒假刷题13： Anu Has a Function Codeforces Round #618 (Div. 2) C
题目链接: Anu Has a Function 题目解析: 观察函数f(x,y)定义:(x|y)-y 即取出来x里是1但是y里不是1的地方也就是 x&(~y) (也可以列真值表) 因此题 ...
Codeforces Round #618 (Div. 2)C、Anu Has a Function
C. Anu Has a Function time limit per test1 second memory limit per test256 megabytes inputstandard i ...
Codeforces #618 div.2 C. Anu Has a Function
C. Anu Has a Function time limit per test1 second memory limit per test256 megabytes inputstandard i ...
贪心 ---- Codeforces Round #618 (Div. 2)B. Assigning to Classes+贪心[证明过程]
题目链接题目大意:给你2∗n2*n2∗n个数,将这些数分成2个集合使得两个集合中位数的差值最小解题思路:我懵了一个结论就是排序之后取中间的两个数然后就ac了我们先对这些数字从小到大排序证明:1 ...
Codeforces Round #618 (Div. 2)-B. Assigning to Classes
Reminder: the median of the array [a1,a2,-,a2k+1] of odd number of elements is defined as follows: l ...
Codeforces Round #618 (Div. 2)-Non-zero
Guy-Manuel and Thomas have an array a of n integers [a1,a2,-,an]. In one step they can add 1 to any ...
Codeforces Round #506 (Div. 3)
Codeforces Round #506 (Div. 3) 实习期间事不多,对div3 面向题解和数据编程了一波 A. Many Equal Substrings 题目链接 A题就是找后缀和前缀重合 ...

Codeforces Round #618 (Div. 2)-C. Anu Has a Function

Codeforces Round #618 (Div. 2)-C. Anu Has a Function相关推荐

最新文章

热门文章