# def f():
# print(3.1415926535897)
# f()
# def f():
# print('*')
# f()
# def f():
# print('**')
# f()
# a = int(input())
# def f(a):
# if a == 0: print('zero')
# else: print('non zero')
# f(a)
# argument 매개변수 들
# def f(a,b,c):
# # print('3.140000')
# return a
# f()
# 자유==편리 (x)
# 내가 다 알고있어야 자유를 누릴수있어
# 에버랜드 자유이용권 ( t익스->사파리예약->어디밥먹고->예약걸어놓거->락스핀타고)
# n = int(input())
# minority = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997]
# for i in range(n):
# if minority[i] > n:
# print('composite')
# break
# if minority[i] == n:
# print('prime')
# break
# a = input()
# a = reversed(a)
# print(''.join(a))
# n = int(input())
# arr = list(map(int, input().split()))
# tar = int(input())
# if arr[n - 1] < tar:
# print(n + 1)
# exit()
# def lower_bound(n, arr, tar):
# for i in range(n):
# if arr[i] == tar or arr[i] > tar:
# return i + 1
# print(lower_bound(n, arr, tar))
# n = int(input())
# arr = list(map(int, input().split()))
# tar = int(input())
# def f(n, arr, tar):
# for i in range(n):
# if arr[i] == tar:
# return i + 1
# return -1
# print(f(n, arr, tar))
life_map = [list(map(int, input().split())) for i in range(25)]
next_map = [[int(0) for i in range(25)] for j in range(25)]
dx = [0, 1, 1, 1, 0, -1, -1, -1]
dy = [-1, -1, 0, 1, 1, 1, 0, -1]
def plus(i, j):
sum = 0
for i in range(i - 1, i + 2):
for j in range(j - 1, j + 2):
if 0 <= i <= 24 and 0 <= j <= 24:
sum += life_map[i][j]
return sum - life_map[i][j]
print(plus(23, 23))
# for i in range(25):
# for j in range(25):
# a = plus(i, j)
# if life_map[i][j] == 0:
# if a == 3:
# next_map[i][j] = 1
# elif life_map[i][j] == 1:
# if a >= 4 or a <= 1:
# next_map[i][j] = 0
# elif a == 2 or a == 3:
# next_map[i][j] = 1
# print()
# for i in range(25):
# for j in range(25):
# print(next_map[i][j], end = ' ')
# print()
top of page
실제 작동 상태를 확인하려면 라이브 사이트로 이동하세요.
20240413
20240413
댓글 0개
좋아요
댓글(0)
bottom of page