Submission

Score: 100

User: qweqwe

Problemset: วิศวกรรมข้อมูล

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-16 19:26:41

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define db long double
#define INF 1e15
using namespace std;

int main(){
    int n;cin >> n;
    vector<int> v(n);
    for (int i=0;i<n;i++){
        cin >> v[i];
    }sort(v.begin(),v.end());
    ll mx=0;
    do{
        string binary="";
        ll sum=0;
        for (int i:v){
            //cout << i << " ";
            string temp="";
            while (i>0){
                temp+=(i%2+'0');
                i/=2;
            }
            //cout << temp << " ";
            binary+=temp;
        }//cout << binary << "\n";
        int m=binary.size();
        reverse(binary.begin(),binary.end());
        for (int i=0;i<m;i++){
            sum+=(binary[i]-'0')*(1<<(m-i-1));
        }mx=max(mx,sum);
    }while (next_permutation(v.begin(),v.end()));
    cout << mx;
    return 0;
}