Codeforces Round #276 (Div. 2)（C贪心，D）

最新推荐文章于 2018-11-20 22:15:00 发布

u010660276

最新推荐文章于 2018-11-20 22:15:00 发布

阅读量631

点赞数

分类专栏： codeforces 贪心

本文链接：https://blog.csdn.net/u010660276/article/details/40918149

版权

codeforces 同时被 2 个专栏收录

91 篇文章 0 订阅

订阅专栏

贪心

23 篇文章 0 订阅

订阅专栏

Let's denote as $\text{[math]}$ the number of bits set ('1' bits) in the binary representation of the non-negative integerx.

You are given multiple queries consisting of pairs of integers l and r. For each query, find thex, such that l ≤ x ≤ r, and $\text{[math]}$ is maximum possible. If there are multiple such numbers find the smallest of them.

Input

The first line contains integer n — the number of queries (1 ≤ n ≤ 10000).

Each of the following n lines contain two integersl_i, r_i — the arguments for the corresponding query (0 ≤ l_i ≤ r_i ≤ 10¹⁸).

Output

For each query print the answer in a separate line.

Sample test(s)

Input

Output

1
3
7

Note

The binary representations of numbers from 1 to 10 are listed below:

1₁₀ = 1₂

2₁₀ = 10₂

3₁₀ = 11₂

4₁₀ = 100₂

5₁₀ = 101₂

6₁₀ = 110₂

7₁₀ = 111₂

8₁₀ = 1000₂

9₁₀ = 1001₂

10₁₀ = 1010₂

_{刚开始想反了，选择了从高位相低位处理，其实应该从低位向高位处理才对，这样的得到的才是最多的最小的}

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
typedef long long LL;
int N;
int s[100];
int main()
{
    scanf("%d",&N);
    while(N--)
    {
        LL l,r;
        scanf("%I64d%I64d",&l,&r);
        LL tmp=l,ans=l,ans1=l;
        int len=0;
        memset(s,0,sizeof(s));
        while(tmp)
        {
            s[len++]=tmp%2;
            tmp>>=1;
        }
        for(int i=0;i<64;i++)
        {
            if(!s[i])
            {
                l+=(1LL<<i);
                if(l>r){printf("%I64d\n",ans);break;}
                ans=l;
            }
        }
    }
    return 0;
}

You are given a sequence a consisting of n integers. Find the maximum possible value of $\text{[math]}$ (integer remainder of a_i divided by a_j), where 1 ≤ i, j ≤ n and a_i ≥ a_j.

Input

The first line contains integer n — the length of the sequence (1 ≤ n ≤ 2·10⁵).

The second line contains n space-separated integers a_i (1 ≤ a_i ≤ 10⁶).

Output

Print the answer to the problem.

Sample test(s)

Input

3
3 4 5

Output

首先预处理出里每个数最近的是谁，然后枚举每个数的倍数，更新答案

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
typedef long long LL;
int n,x,min1,ans,max1;
const int INF=1000000000;
int hash[2100000], dp[2100000], a[2100000];
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        memset(hash,0,sizeof(hash));
        min1=INF;
        max1=-1;
        for(int i=0; i<n; i++)
        {
            scanf("%d",&x);
            hash[x]=1;
            min1=min(min1,x);
            max1=max(max1,x);
        }
        for(int i=min1; i<=2000000; i++)
        {
            if(hash[i-1]) dp[i]=i-1;
            else dp[i]=dp[i-1];
        }
        ans=0;
        for(int i=1; i<=1000000; i++)
        {
            if(hash[i])
            {
                for(int j=2*i; ; j+=i)
                {
                    if(dp[j]<i) continue ;
                    ans=max(ans,dp[j]%i);
                    if(dp[j]==max1) break;
                }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}