Submission

Score: 100

User: PunPunTham24

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-01 14:41:45

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

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