Solutions for Safe Position

    • @AaronSkake
    • @Daniel, submitted in Python 3, achived 100% score
    def solve(n, k):
          if (n == 1):
              return 1
          else:
              return (solve(n - 1, k) + k-1) % n + 1