109B - Lucky Probability - CodeForces Solution


brute force probabilities *1900

Please click on ads to support us..

Python Code:

pl, pr, vl, vr, k = map(int, input().split())
p, x = [0, 1e9], 0


def g(x):
    if x < 1e9:
        p.append(x)
        g(10 * x + 4), g(10 * x + 7)


g(4), g(7), p.sort()


def f(a, b, c, d):
    res = max(0, min(b, d) - max(a, c) + 1)
    return res


for i in range(1, len(p) - k):
    l1 = p[i - 1] + 1
    l2 = p[i]
    l3 = p[i + k - 1]
    l4 = p[i + k] - 1
    x += f(l1, l2, vl, vr) * f(l3, l4, pl, pr) + f(l1, l2, pl, pr) * f(l3, l4, vl, vr)
    if k == 1 and max(vl, pl) <= l2 <= min(vr, pr):
        x -= 1
print(1. * x / ((pr - pl + 1) * (vr - vl + 1)))


Comments

Submit
0 Comments
More Questions

1091A - New Year and the Christmas Ornament
1352B - Same Parity Summands
1102A - Integer Sequence Dividing
630B - Moore's Law
1004A - Sonya and Hotels
1680B - Robots
1690A - Print a Pedestal (Codeforces logo)
1295A - Display The Number
1077A - Frog Jumping
1714G - Path Prefixes
1369C - RationalLee
289B - Polo the Penguin and Matrix
1716A - 2-3 Moves
1670B - Dorms War
1716B - Permutation Chain
987A - Infinity Gauntlet
1676G - White-Black Balanced Subtrees
1716D - Chip Move
1352F - Binary String Reconstruction
1487B - Cat Cycle
1679C - Rooks Defenders
56A - Bar
1694B - Paranoid String
35A - Shell Game
1684A - Digit Minimization
43B - Letter
1017A - The Rank
1698B - Rising Sand
235A - LCM Challenge
1075B - Taxi drivers and Lyft