跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2729. Periodical Numbers

  • ID: 2735
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:提高
  • 上传者:
  • 组合数学
  • 动态规划
  • 数论
  • 数学
  • 提高
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Periodical Numbers

题目描述

E. Periodical Numbers
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

A non-empty string s is called binary, if it consists only of characters "0" and "1". Let's number the characters of binary string s from 1 to the string's length and let's denote the i-th character in string s as si.

Binary string s with length n is periodical, if there is an integer 1≤k<n such that:

  • k is a divisor of number n
  • for all 1≤i≤n-k, the following condition fulfills: si=si+k

For example, binary strings "101010" and "11" are periodical and "10" and "10010" are not.

A positive integer x is periodical, if its binary representation (without leading zeroes) is a periodic string.

Your task is to calculate, how many periodic numbers are in the interval from l to r (both ends are included).

Input

The single input line contains two integers l and r (1≤l≤r≤1018). The numbers are separated by a space.

Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.

Output

Print a single integer, showing how many periodic numbers are in the interval from l to r (both ends are included).

Examples
Input
1 10
Output
3
Input
25 38
Output
2
Note

In the first sample periodic numbers are 3, 7 and 10.

In the second sample periodic numbers are 31 and 36.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2396 题。保留原作者与原赛事署名。