C. Kevin and Binary Strings solution

-
C. Kevin and Binary String solution 

 Codeforces Global Round 28
 #codeforces 👇

https://youtu.be/IynBLgnJe5k?feature=shared


Comments

Post a Comment

Popular posts from this blog

F.Advitiya Security Vault solution code || Codechef STARTERS 171

-
F. Advitiya Security Vault solution code  In Python3 language  👇 MOD = 1000000007 inv2 = 500000004 import sys input = sys.stdin.read data = input().split() index = 0 T = int(data[index]) index += 1 results = [] for _ in range(T):     N = int(data[index])     K = int(data[index + 1])     A = list(map(int, data[index + 2: index + 2 + N]))     index += 2 + N     P = 1     for i in range(N):         if A[i] == 0:             P = P * K % MOD     Q = 1     for j in range(N):         i = N - 1 - j         if A[i] != 0:             if A[j] != 0 and A[j] != A[i]:                 Q = 0                 break         else:             if A[j] == 0:     ...
Read more

G. Strange Nim Game solution code

-
G. Strange Nim Game solution code In Python3 language 👇 import sys MOD = 10 ** 9 + 7 def main (): sys.setrecursionlimit( 1 << 25 ) max_x = 200000 grundy = [ 0 ] * (max_x + 1 ) for x in range ( 1 , max_x + 1 ): digits = set () tmp = x while tmp > 0 : d = tmp % 10 if d != 0 : digits.add(d) tmp = tmp // 10 s = set () for d in digits: if x >= d: s.add(grundy[x - d]) mex = 0 while mex in s: mex += 1 grundy[x] = mex max_pow = 2 * 10 ** 5 + 30 pow2 = [ 1 ] * (max_pow + 1 ) for i in range ( 1 , max_pow + 1 ): pow2[i] = (pow2[i- 1 ] * 2 ) % MOD class SegmentTreeNode : def __init__ ( self, l, r ): self.l = l self.r = r self.left = None self.right = None self.basis = [ 0 ] * 30 ...
Read more