1985G - D-Function - CodeForces Solution


bitmasks combinatorics math number theory

Please click on ads to support us..

Python Code:

def power(x, y, p) :
    res = 1 
    x = x % p 
    if (x == 0) :
        return 0
    while (y > 0) :
        if ((y & 1) == 1) :
            res = (res * x) % p
        y = y >> 1
        x = (x * x) % p
         
    return res

for t in range(int(input())):
    l,r,k = map(int,input().split())
    if k >= 10:
        print(0)
    else:
        v = 10 // k
        if 10 % k:
            v += 1
        
        mod = 10**9 + 7
        rt = power(v, r, mod)
        lt = power(v, l, mod)
                ans = (rt - lt) % mod
        print(ans)




Comments

Submit
0 Comments
More Questions

765A - Neverending competitions
1303A - Erasing Zeroes
1005B - Delete from the Left
94A - Restoring Password
1529B - Sifid and Strange Subsequences
1455C - Ping-pong
1644C - Increase Subarray Sums
1433A - Boring Apartments
1428B - Belted Rooms
519B - A and B and Compilation Errors
1152B - Neko Performs Cat Furrier Transform
1411A - In-game Chat
119A - Epic Game
703A - Mishka and Game
1504C - Balance the Bits
988A - Diverse Team
1312B - Bogosort
1616B - Mirror in the String
1660C - Get an Even String
489B - BerSU Ball
977C - Less or Equal
1505C - Fibonacci Words
1660A - Vasya and Coins
1660E - Matrix and Shifts
1293B - JOE is on TV
1584A - Mathematical Addition
1660B - Vlad and Candies
1472C - Long Jumps
1293D - Aroma's Search
918A - Eleven