Popular posts from this blog
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 ...
Toggle challenge solution code (Zone 2)round 1 TCS CodeVita Season 12
Toggle Challenge solution code In Python3 language Zone 2 (Round 1) TCS CodeVita Season 12 def read_segments(): # Read 7-segment digits from the input return [input() for _ in range(3)] def get_digit_mapping(): # Create a mapping of the digits from the first 3x9 matrix input digit_mapping = {} for digit in range(10): digit_representation = [ SEGMENTS[i][digit*3:digit*3+3] for i in range(3) ] digit_mapping[digit] = digit_representation return digit_mapping def find_possible_numbers(led_input, digit_mapping): # Convert the 3x3 representation of each digit into a number or report if it's invalid num_digits = len(led_input[0]) // 3 total_sum = 0 all_valid = True for digit_index in range(num_digits): ...
Comments
Post a Comment