分治的思想，二分法，采用BigInteger解决大数
Jon fought bravely to rescue the wildlings who were attacked by the white-walkers at Hardhome. On his arrival, Sam tells him that he wants to go to Oldtown to train at the Citadel to become a maester, so he can return and take the deceased Aemon’s place as maester of Castle Black. Jon agrees to Sam’s proposal and Sam sets off his journey to the Citadel. However becoming a trainee at the Citadel is not a cakewalk and hence the maesters at the Citadel gave Sam a problem to test his eligibility.

Initially Sam has a list with a single element n. Then he has to perform certain operations on this list. In each operation Sam must remove any element x, such that x > 1, from the list and insert at the same position , , sequentially. He must continue with these operations until all the elements in the list are either 0 or 1.

Now the masters want the total number of 1s in the range l to r (1-indexed). Sam wants to become a maester but unfortunately he cannot solve this problem. Can you help Sam to pass the eligibility test?

Input

The first line contains three integers n, l, r (0 ≤ n < 250, 0 ≤ r - l ≤ 105, r ≥ 1, l ≥ 1) – initial element and the range l to r.

It is guaranteed that r is not greater than the length of the final list.

Output

Output the total number of 1s in the range l to r in the final sequence.

Example

Input
7 2 5
Output
4
Input
10 3 10
Output
5


import java.math.BigInteger;
import java.util.Scanner;
import java.util.regex.Matcher;/*** Created by 95112 on 10/21/2017.*/
public class TwoPoint {private static long sum = 1;private static BigInteger ans;static BigInteger two;public static void main(String[] args){Scanner scanner = new Scanner(System.in);ans = new BigInteger("0");BigInteger n = new BigInteger(scanner.next());BigInteger l = new BigInteger(scanner.next());BigInteger r = new BigInteger(scanner.next());BigInteger x = new BigInteger("1");BigInteger y = new BigInteger("1");BigInteger tmp = n.add(new BigInteger("0"));two = new BigInteger("2");while (tmp.compareTo(x) == 1){tmp = tmp.divide(two);y = y.multiply(two).add(x);}solve(x,y,l,r,n);System.out.println(ans.toString());}private static  void solve(BigInteger x,BigInteger y , BigInteger l , BigInteger r , BigInteger n){if (x.compareTo(y) == 1 || l.compareTo(r) == 1)return;BigInteger mid = x.add(y).divide(two);if ( mid.compareTo(l) == -1 )solve(mid.add(BigInteger.ONE),y,l,r,n.divide(two));else if (mid.compareTo(r) == 1)solve(x,mid.subtract(BigInteger.ONE),l,r,n.divide(two));else {ans = ans.add(n.mod(two));solve(mid.add(BigInteger.ONE),y,mid.add(BigInteger.ONE),r,n.divide(two));solve(x,mid.subtract(BigInteger.ONE),l,mid.subtract(BigInteger.ONE),n.divide(two));}}
}

分治问题CodeForces768B大数相关推荐

python递归算法电影院票价问题_算法课堂实验报告（二）——python递归和分治（第k小的数，大数乘法问题）...
python实现递归和分治一.开发环境开发工具:jupyter notebook 并使用vscode,cmd命令行工具协助编程测试算法,并使用codeblocks辅助编写C++程序编程语言:py ...
大数相乘（C语言，分治算法）
问题: 由于编程语言提供的基本数值数据类型表示的数值范围有限,不能满足较大规模的高精度数值计算,因此需要利用其他方法实现高精度数值的计算,于是产生了大数运算.大数运算主要有加.减.乘三种方法. 下面就 ...
python入门算法_Python 算法入门教程
分治算法介绍今天我们聊一聊计算机中非常重要和常用的一种算法:分治算法.它在计算机领域应用广泛,几乎无处不在.不仅计算机领域,在信号处理领域,分而治之也是十分常见的一种信号处理方法.著名快速傅里叶变换 ...
最全最详细数据结构与算法视频-【附课件和源码】
源码和课件下载方式在文末什么是数据结构与算法算法用来设计并实现一种用计算机来解决问题的方法.它满足下列性质: 输入:有零个或多个输入量输出:产生至少一个输出量确定性:算法的指令清晰.无歧义有 ...
详解分治法（divide-and-conquer）及其典型应用
什么是分治法在昨天的文章<漫谈数据库中的join>的最后,提到Grace hash join和Sort-merge join都是基于分治思想的.分治法(divide-and-conque ...
斐波那契数列取模（大数）分治算法
斐波那契数列取模(大数)分治算法这是算法课程上完分之策略后老师留的一道题目: 菲波那契数列如下:1,1,2,3,5,8,13,21,34......其中a[1] = 1, a[2] = 1, a[n ...
【恋上数据结构】贪心（最优装载、零钱兑换、0-1背包）、分治（最大连续子序列和、大数乘法）
贪心.分治贪心(Greedy) 问题1:最优装载(加勒比海盗) 问题2:零钱兑换零钱兑换的另一个例子贪心注意点问题3:0-1背包 0-1 背包 - 实例一些习题分治(Divide And ...
第十章分治算法(大数相乘)
分治算法:分治算法由两部分组成,分和治,分是使问题规模变小,递归解决较小的问题,治是从子问题的解中构建原问题的解. 传统上,在正文中至少含有两个递归调用的例程叫做分治算法,而正文中只含有一个递归调用的 ...
POJ1001 求高精度幂（分治高精度大数相乘）
总体思路: 高精度大数乘法需要记录小数点位置需要使用大数相乘只是考验能否使用大数相乘大整数乘法可以模拟乘法运算写也可以使用分治写法分治可以优化XY=AC2^N [(A-B)(D-C)+AC ...

分治问题CodeForces768B大数

Input

Output

Example

分治问题CodeForces768B大数相关推荐

最新文章

热门文章