Love丶FFC's Blog
1.定义足够的变量存储相关的值并进行判断。
2.注意一些细节。
N, M = map(int, input().split()) # N:苹果树的棵树,M:疏果操作的轮数 Apple = [[0 for i in range(M + 1)] for j in range(N)] # 初始化苹果列表 # Apple[i][0]代表的是第i棵树初始的苹果数 Apple[i][1-M]代表的是第i棵树疏果的个数 AppleCount = [0 for i in range(N)] # 疏果操作结束后每棵树的苹果个数 Count = 0 # 疏果操作结束后总的苹果个数 Max = 0 # 最多的疏果个数 MaxID = 0 # 疏果个数最多的苹果树的编号 for i in range(N): Apple[i] = [int(n) for n in input().split()] # 输入一行列表的值 for j in range(M + 1): AppleCount[i] += Apple[i][j] Count += AppleCount[i] # 完成T操作 if Apple[i][0] - AppleCount[i] > Max: Max = Apple[i][0] - AppleCount[i] # 完成P操作 MaxID = i # 完成K操作 elif Apple[i][0] - AppleCount[i] == Max and i < MaxID: # 补充K操作的意外条件 MaxID = i # 按题目格式进行输出 print(str(Count) + " " + str(MaxID + 1) + " " + str(Max))
Knitant
online generic cialis View Article PubMed NCBI Google Scholar 73
invoimi
where to get viagra Hwang is Chief of Breast Surgery at Duke Cancer Institute, Durham, North Carolina
Eakfea
fenofibrate 200mg sale order fenofibrate 200mg without prescription where can i buy fenofibrate
Yorgbc
order ketotifen 1mg pills geodon where to buy buy generic imipramine over the counter
Xuwlzt
purchase mintop without prescription natural ed pills best ed medication
Rkwpdv
acarbose medication where can i buy prandin griseofulvin 250 mg usa