1999E - Triple Operations - CodeForces Solution


dp implementation math

Please click on ads to support us..

Python Code:

def b3(n):
    cnt = 0
    while n:
        n //= 3
        cnt += 1
    return cnt

pref = [0]
for i in range(1,2*100000+1):
    pref.append(pref[-1] + b3(i))

for _ in range(int(input())):
    l, r = [int(x) for x in input().split()]
    s = b3(l)
    s += pref[r] - pref[l-1]
    print(s)


Comments

Submit
0 Comments
More Questions

791A - Bear and Big Brother
1452A - Robot Program
344A - Magnets
96A - Football
702B - Powers of Two
1036A - Function Height
443A - Anton and Letters
1478B - Nezzar and Lucky Number
228A - Is your horseshoe on the other hoof
122A - Lucky Division
1611C - Polycarp Recovers the Permutation
432A - Choosing Teams
758A - Holiday Of Equality
1650C - Weight of the System of Nested Segments
1097A - Gennady and a Card Game
248A - Cupboards
1641A - Great Sequence
1537A - Arithmetic Array
1370A - Maximum GCD
149A - Business trip
34A - Reconnaissance 2
59A - Word
462B - Appleman and Card Game
1560C - Infinity Table
1605C - Dominant Character
1399A - Remove Smallest
208A - Dubstep
1581A - CQXYM Count Permutations
337A - Puzzles
495A - Digital Counter