CF926A.2-3-numbers

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

A positive integer is called a 2-3-integer, if it is equal to 2x3y2^{x}·3^{y} for some non-negative integers xx and yy . In other words, these integers are such integers that only have 22 and 33 among their prime divisors. For example, integers 11 , 66 , 99 , 1616 and 108108 — are 2-3 integers, while 55 , 1010 , 2121 and 120120 are not.

Print the number of 2-3-integers on the given segment [l,r][l,r] , i. e. the number of sich 2-3-integers tt that l<=t<=rl<=t<=r .

输入格式

The only line contains two integers ll and rr ( 1<=l<=r<=21091<=l<=r<=2·10^{9} ).

输出格式

Print a single integer the number of 2-3-integers on the segment [l,r][l,r] .

输入输出样例

  • 输入#1

    1 10
    

    输出#1

    7
    
  • 输入#2

    100 200
    

    输出#2

    5
    
  • 输入#3

    1 2000000000
    

    输出#3

    326
    

说明/提示

In the first example the 2-3-integers are 11 , 22 , 33 , 44 , 66 , 88 and 99 .

In the second example the 2-3-integers are 108108 , 128128 , 144144 , 162162 and 192192 .

首页