알고리즘 문제 풀기/Codeup
Codeup 1521 - 인삼밭(택배 수령)
bug_maker
2019. 3. 31. 10:38
<http://codeup.kr/problem.php?id=1521>
Codeup 1521 - 인삼밭(택배 수령)
k, n = map(int, input().split())
sun_shield = 0
matrix = []
for i in range(k):
input_matrix = list(map(int, input().split()))
matrix.append(input_matrix)
for i in range(0, k):
for j in range(0, k):
if (matrix[i][j] != -1) and (1 <= matrix[i][j]+n <= 5):
sun_shield += 1
print(sun_shield)