https://arc.net/l/quote/avipdfag
讀入J、R 先建立一個players陣列 代表有幾位玩家 每位初始分數為零
再來讀入數列 以enumerate計數迴圈歷遍 去判段當前分數是哪位玩家的 並且每次更新分數時同時去判斷當前最高分玩家是誰
while True:
try:
J, R = map(int, input().split())
players = [0] * J
max_score = 0
winner = 0
nums = list(map(int, input().split()))
for idx, score in enumerate(nums):
player_idx = idx % J
players[player_idx] += score
if players[player_idx] >= max_score:
max_score = players[player_idx]
winner = player_idx
print(winner + 1)
except:
break