Submission

Score: 100

User: fillhavertz

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-13 22:14:54

#include <vector>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n;
    cin>>n;
    vector<int> vec(n);
    vector<string> trans(n);
    for(int i=0;i<n;i++) cin>>vec[i];


    for(int i=0;i<n;i++) {
        int fortrans = (floor(log2(vec[i])));
        for(int j=0;j<=fortrans;j++){
            char temp;
            if(vec[i]%2) trans[i]+='1';
            else trans[i] += '0';
            vec[i]/=2;
        }reverse(trans[i].begin(),trans[i].end());
        //cout<<trans[i]<<' ';
    }
    string str;
    int maxx =0;
    sort(trans.begin(),trans.end());
    do{
        str.clear();
        for(int i=0;i<n;i++) {
            str+=trans[i];
        }maxx = max(stoi(str,0,2),maxx);
    }while(next_permutation(trans.begin(),trans.end()));
    cout<<maxx;

    
}