1 solutions

  • 0
    @ 2024-12-5 18:19:40

    C++ :

    #include<bits/stdc++.h>
    using namespace std;
    long long a[1000010];
    bool cmp(int a,int b)
    {
    	return a>b;
    }
    int main()
    {
    	int n;
    	scanf("%d",&n);
    	for(int i=1;i<=n;i++)
    	{
    		scanf("%lld",&a[i]);
    	}
    	sort(a+1,a+n+1,cmp);
    	n=min(n,32);
    	long long mx=0;
    	for(int i=1;i<=n;i++)
    	{
    		for(int j=1;j<=n;j++)
    		{
    			if(i!=j)
    			{
    				mx=max(mx,a[i]&a[j]);
    			}
    		}
    	}
    	cout<<mx;
    	return 0;
    }
    
    • 1

    Information

    ID
    9169
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By