We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 4d960dd commit b29f3e1Copy full SHA for b29f3e1
programmers/Lv.1/failure_percent.py
@@ -1,10 +1,11 @@
1
def solution(N, stages):
2
- stage_score = [0] * (N + 2)
+ stage_score = []
3
+ for i in range(N + 2):
4
+ stage_score.append([i, 0, 0])
5
for stage in stages:
- stage_score[stage] += 1
- stage_failure = []
6
- for i in range(1, N + 2):
7
- stage_failure.append(stage_score[i] / sum(stage_score[i:N + 2]))
8
- print(stage_failure)
+ stage_score[stage][1] += 1
+ for i in range(1, N + 1):
+ stage_score[stage][2] = stage_score[i][1] / sum(stage_score[i:N + 2])
9
+ print(stage_score)
10
answer = []
11
return answer
0 commit comments