Submission

Score: 100

User: Meme.137

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-01 14:29:15

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

int main(){
	vector<string> m;
	vector<int> k;
	int n;
	cin>>n;
	for(int i=0;i<n;i++){
		int x;
		cin>>x;
		string r="";
		while(x!=0){
			r=to_string(x%2)+r;
			x/=2;
		}
		m.push_back(r);
	}
	int Max=INT_MIN;
	for(int i=0;i<n;i++) k.push_back(i);
	do{
		string l="";
		for(int i=0;i<n;i++) l+=m[k[i]];
		Max=max(Max,stoi(l,0,2));
	}	while(next_permutation(k.begin(),k.end()));
	cout<<Max;
}