我的第二题： n = int(input()) data = list(map(int,input().split())) time = [0 for _ in range(n)] arr_max = max(data) k = 0 while arr_max >= n: op = 0 for i in range(n): time[i] = data[i] // n op = op + data[i] // n data[i] = data[i] - time[i] * n k = k + op arr_max = -1 for i in range(n): data[i] = data[i] + op - time[i] arr_max = max(arr_max,data[i]) print(k)