Submission

Score: 0

User: Imorange

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-13 22:38:35

#include <bits/stdc++.h>

using namespace std;

string binum(int n)
{
  string s = "";
  while (n > 0)
  {
    s = to_string(n%2) + s;
    n/=2;
  }
  return s;
  
}
int main()
{
  int n;
  cin >> n;
  vector<int> v(n);
  for(int i = 0; i < n; i++){
    cin >> v[i];
  }

  int ma = 0;

  sort(v.begin(), v.end());
  do{
      string t;
      for(auto i : v)t+=binum(i);
      cout << t << '\n';
      int u = 0;
      for(int i = 0; i < t.size(); i++)
      {
        if(t[i] == '1')
        {
          int r = t.size();
          u += pow(2, abs(i-r+1));
        }
        
      }
      ma = max(ma,u);
  }while(next_permutation(v.begin(), v.end()));

  cout << ma;
}