1965A - Everything Nim - CodeForces Solution


games greedy

Please click on ads to support us..

Python Code:

t = int(input())
for _ in range(t):
  n = int(input())
  an = list(map(int, input().split()))
  an.sort()
  maxsize = an[-1]
  mexsize = 1
  for sz in an:
    if sz == mexsize:
      mexsize += 1

  if mexsize > maxsize:
    print("Alice" if maxsize % 2 == 1 else "Bob")
  else:
    print("Alice" if mexsize % 2 == 1 else "Bob")


Comments

Submit
0 Comments
More Questions

42. Trapping Rain Water
32. Longest Valid Parentheses
Cutting a material
Bubble Sort
Number of triangles
AND path in a binary tree
Factorial equations
Removal of vertices
Happy segments
Cyclic shifts
Zoos
Build a graph
Almost correct bracket sequence
Count of integers
Differences of the permutations
Doctor's Secret
Back to School
I am Easy
Teddy and Tweety
Partitioning binary strings
Special sets
Smallest chosen word
Going to office
Color the boxes
Missing numbers
Maximum sum
13 Reasons Why
Friend's Relationship
Health of a person
Divisibility