-
Notifications
You must be signed in to change notification settings - Fork 1
/
1635A - Min Or Sum.cpp
51 lines (48 loc) · 1.51 KB
/
1635A - Min Or Sum.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
/** ========================================**
** @Author: Kareem Taha Abdelfatah
** @Category: Codeforces problems solutions
** @brief: Problem Solving solutions
/** ========================================**/
#include<bits/stdc++.h>
#include<iterator>
using namespace std;
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define endll "\n"
#define ll long long
#define fr(i, n) for(ll i = 0; i < n; i++)
#define fr1(i, n) for(ll i = 1; i <= n; i++)
#define asort(a) sort(a + 1, a + n + 1)
#define dsort(a) sort(a + 1, a + n + 1, greater<int>())
#define LightOn(n, k) ((n) | (1<<k))
#define Lightoff(n, k) ((n) & (~(1<<k)))
#define IsOn(n, k) ((n>>k) & 1)
const long long N = 2e5 + 5, MOD = 1e9 + 7, oo = 1e18;
const double PI = 3.14;
const double Prox = 1e-7;
map<ll, ll>mp;
ll a[N], b[N];
set<ll>s;
string GetBinary(ll n){
string ret = "";
for(ll i = 31; i >= 0; i--) ret += to_string(IsOn(n, i));
return ret;
}
// right shift (n) = num / pow(2, n);
// left shift (n) = num * pow(2, n);
// sleep(micro second); for slow execution
int main()
{
IO
ll Tc; cin >> Tc;
while(Tc--){
mp.clear();
ll n, ans = 0; cin >> n;
for(ll i = 0; i < n; i++){
cin >> a[i];
for(ll j = 0; j <= 31; j++) if(IsOn(a[i], j)) mp[j]++;
}
for(ll j = 0; j <= 31; j++) if(mp[j] >= 1) ans += pow(2, j);
cout << ans << endll;
}
return 0;
}