Submission

Score: 100

User: loop

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

Language: cpp

Time: 0.003 second

Submitted On: 2026-10-10 18:33:21

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

string bin(int x) {
    string s = "";
    while (x > 0) { s = char('0' + x % 2) + s; x /= 2; }
    return s;
}

int main() {
    int n, v[4], idx[4];
    cin >> n;
    for (int i = 0; i < n; i++) { cin >> v[i]; idx[i] = i; }
    long long best = 0;
    do {
        string s = "";
        for (int i = 0; i < n; i++) s += bin(v[idx[i]]);
        long long val = 0;
        for (int i = 0; i < (int)s.size(); i++) val = val * 2 + (s[i] - '0');
        if (val > best) best = val;
    } while (next_permutation(idx, idx + n));
    cout << best << '\n';
    return 0;
}