CF109B.Lucky Probability
普及+/提高
通过率:0%
时间限制:2.00s
内存限制:256MB
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya and his friend Vasya play an interesting game. Petya randomly chooses an integer p from the interval [p__l, p__r] and Vasya chooses an integer v from the interval [v__l, v__r] (also randomly). Both players choose their integers equiprobably. Find the probability that the interval [min(v, p), max(v, p)] contains exactly k lucky numbers.
佩蒂亚喜欢幸运数字。众所周知,幸运数字是指十进制表示中仅包含幸运数字 4 和 7 的正整数。例如,47、744、4 是幸运数字,而 5、17、467 不是。
佩蒂亚和他的朋友瓦夏正在玩一个有趣的游戏。佩蒂亚在区间 [pl, pr] 中随机选取一个整数 p,瓦夏在区间 [vl, vr] 中随机选取一个整数 v(也均为均匀随机选取)。求区间 [min(v, p), max(v, p)] 中恰好包含 k 个幸运数字的概率。
输入格式
The single line contains five integers p__l, p__r, v__l, v__r and k (1 ≤ p__l ≤ p__r ≤ 109, 1 ≤ v__l ≤ v__r ≤ 109, 1 ≤ k ≤ 1000).
单行包含五个整数 pl、pr、vl、vr 和 k(1 ≤ pl ≤ pr ≤ 109,1 ≤ vl ≤ vr ≤ 109,1 ≤ k ≤ 1000)。
输出格式
On the single line print the result with an absolute error of no more than 10 - 9.
在单行中输出结果,绝对误差不超过 10−9。
输入输出样例
输入#1
1 10 1 10 2
输出#1
0.320000000000
输入#2
5 6 8 10 1
输出#2
1.000000000000
说明/提示
Consider that [a, b] denotes an interval of integers; this interval includes the boundaries. That is, 
In first case there are 32 suitable pairs: (1, 7), (1, 8), (1, 9), (1, 10), (2, 7), (2, 8), (2, 9), (2, 10), (3, 7), (3, 8), (3, 9), (3, 10), (4, 7), (4, 8), (4, 9), (4, 10), (7, 1), (7, 2), (7, 3), (7, 4), (8, 1), (8, 2), (8, 3), (8, 4), (9, 1), (9, 2), (9, 3), (9, 4), (10, 1), (10, 2), (10, 3), (10, 4). Total number of possible pairs is 10·10 = 100, so answer is 32 / 100.
In second case Petya always get number less than Vasya and the only lucky 7 is between this numbers, so there will be always 1 lucky number.
设 ([a, b]) 表示一个整数区间,该区间包含端点。即:
第一种情况中有 32 个满足条件的数对:(1, 7), (1, 8), (1, 9), (1, 10), (2, 7), (2, 8), (2, 9), (2, 10), (3, 7), (3, 8), (3, 9), (3, 10), (4, 7), (4, 8), (4, 9), (4, 10), (7, 1), (7, 2), (7, 3), (7, 4), (8, 1), (8, 2), (8, 3), (8, 4), (9, 1), (9, 2), (9, 3), (9, 4), (10, 1), (10, 2), (10, 3), (10, 4)。所有可能的数对总数为 (10 \times 10 = 100),因此答案为 (32 / 100)。
第二种情况下,Petya 总是得到比 Vasya 小的数,且唯一的幸运数字 7 恰好位于这两个数之间,因此幸运数字的个数恒为 1。
输入解题思路,AI测评打分。不知道怎么写?