CF813B.The Golden Age
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Unlucky year in Berland is such a year that its number n can be represented as n=xa+yb , where a and b are non-negative integer numbers.
For example, if x=2 and y=3 then the years 4 and 17 are unlucky ( 4=20+31 , 17=23+32=24+30 ) and year 18 isn't unlucky as there is no such representation for it.
Such interval of years that there are no unlucky years in it is called The Golden Age.
You should write a program which will find maximum length of The Golden Age which starts no earlier than the year l and ends no later than the year r . If all years in the interval [l,r] are unlucky then the answer is 0.
输入格式
The first line contains four integer numbers x , y , l and r ( 2<=x,y<=1018 , 1<=l<=r<=1018 ).
输出格式
Print the maximum length of The Golden Age within the interval [l,r] .
If all years in the interval [l,r] are unlucky then print 0.
输入输出样例
输入#1
2 3 1 10
输出#1
1
输入#2
3 5 10 22
输出#2
8
输入#3
2 3 3 5
输出#3
0
说明/提示
In the first example the unlucky years are 2, 3, 4, 5, 7, 9 and 10. So maximum length of The Golden Age is achived in the intervals [1,1] , [6,6] and [8,8] .
In the second example the longest Golden Age is the interval [15,22] .