Submission

Score: 0

User: ftm

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

Language: cpp

Time: 0.004 second

Submitted On: 2025-09-14 11:13:04

#include<bits/stdc++.h>
using namespace std;
#define f(i,a,b,c) for(int i=a;i<=b;i+=c)
#define r(i,a,b,c) for(int i=a;i>=b;i-=c)
#define fi first
#define se second
#define pb push_back
using ll=long long int;
using pii=pair<int,int>;
const int N=1e6;
const int M=1e9+7;
int a[5],ans;

int main(){
	ios::sync_with_stdio(0); cin.tie(0);
	int n;cin>>n;
	f(i,1,n,1){
		cin>>a[i];
	}
	string num;
	f(i,1,n,1){
		int x=a[i];
		string t;
		while(x>=2){
			t+='0'+(x%2);
			x/=2;
		}
		t+='0'+(x%2);
		reverse(t.begin(),t.end());
		num=num+t;
	}
	//cout<<num;
	reverse(num.begin(),num.end());
	int sum=0;
	sum=0;
	int k=1;
	for(int i=0;i<num.size();i++){
		sum+=k*(num[i]-'0');
		k*=2;
	}
	ans=max(ans,sum);
	sort(a+1,a+n+1);
	f(i,1,n,1){
		int x=a[i];
		string t;
		while(x>=2){
			t+='0'+(x%2);
			x/=2;
		}
		t+='0'+(x%2);
		reverse(t.begin(),t.end());
		num=num+t;
	}
	//cout<<num;
	reverse(num.begin(),num.end());
	sum=0;
	k=1;
	for(int i=0;i<num.size();i++){
		sum+=k*(num[i]-'0');
		k*=2;
	}
	ans=max(ans,sum);
	cout<<ans;
	
}