From afb1459eb450ca083f9a070dfd7d85ec9e2535d0 Mon Sep 17 00:00:00 2001 From: Noori <93557885+loveitall@users.noreply.github.com> Date: Fri, 10 Feb 2023 12:08:36 +0900 Subject: [PATCH 1/4] =?UTF-8?q?[bj1051]=20=EC=88=AB=EC=9E=90=20=EC=A0=95?= =?UTF-8?q?=EC=82=AC=EA=B0=81=ED=98=95?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- recursion/bj1051.py | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 recursion/bj1051.py diff --git a/recursion/bj1051.py b/recursion/bj1051.py new file mode 100644 index 0000000..c1903ca --- /dev/null +++ b/recursion/bj1051.py @@ -0,0 +1,24 @@ +# 1051번 - 숫자 정사각형 +# 각 꼭짓점의 합이 최대가 되는 정사각형을 찾는 문제 + +n, m = map(int, input().split()) + +arr = [] +for i in range(n) : + arr.append(list(map(int, input()))) + +answer = 1 +# 모든 좌표를 탐색한다 +for i in range(n) : + for j in range(m) : + # 50미만까지 + for k in range(1, 50): + # 두 가지를 모두 충족할 때 + if i + k < n and j + k < m : + n == arr[i][j] + + if n == arr[i + k][j] and n == arr[i][j + k] and n == arr[i + k][j + k] : + # n x m 최대값 크기 출력 + answer = max(answer, (k + 1) ** 2) + +print(answer) From 4322b693e8eb148f027b5850f573598cd45673aa Mon Sep 17 00:00:00 2001 From: Noori <93557885+loveitall@users.noreply.github.com> Date: Fri, 10 Feb 2023 12:36:07 +0900 Subject: [PATCH 2/4] =?UTF-8?q?[bj17478]=20=EC=9E=AC=EA=B7=80=ED=95=A8?= =?UTF-8?q?=EC=88=98=EA=B0=80=20=EB=AD=94=EA=B0=80=EC=9A=94=3F?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- recursion/bj17478.py | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 recursion/bj17478.py diff --git a/recursion/bj17478.py b/recursion/bj17478.py new file mode 100644 index 0000000..c7f6dfd --- /dev/null +++ b/recursion/bj17478.py @@ -0,0 +1,17 @@ +# 17478번 - 재귀함수가 뭔가요? + +n = int(input()) + +def recursion(i, n) : + print("____" * i + '"재귀함수가 뭔가요?"') + if i == n : + print("____" * i + '"재귀함수는 자기 자신을 호출하는 함수라네"') + else : + print("____" * i + '"잘 들어보게. 옛날옛날 한 산 꼭대기에 이세상 모든 지식을 통달한 선인이 있었어.') + print("____" * i + '마을 사람들은 모두 그 선인에게 수많은 질문을 했고, 모두 지혜롭게 대답해 주었지.') + print("____" * i + '그의 답은 대부분 옳았다고 하네. 그런데 어느 날, 그 선인에게 한 선비가 찾아와서 물었어."') + recursion(i + 1, n) + print("____" * i + "라고 답변하였지.") + +print("어느 한 컴퓨터공학과 학생이 유명한 교수님을 찾아가 물었다.") +recursion(0, n) From ad95128ed6638599ecf9f32947db0b4fdca48fcb Mon Sep 17 00:00:00 2001 From: Noori <93557885+loveitall@users.noreply.github.com> Date: Fri, 10 Feb 2023 16:05:35 +0900 Subject: [PATCH 3/4] =?UTF-8?q?[Delete]=20=EC=A0=95=EC=82=AC=EA=B0=81?= =?UTF-8?q?=ED=98=95=20=EC=82=AD=EC=A0=9C?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 여기 파트가 아닙니다! --- recursion/bj1051.py | 24 ------------------------ 1 file changed, 24 deletions(-) delete mode 100644 recursion/bj1051.py diff --git a/recursion/bj1051.py b/recursion/bj1051.py deleted file mode 100644 index c1903ca..0000000 --- a/recursion/bj1051.py +++ /dev/null @@ -1,24 +0,0 @@ -# 1051번 - 숫자 정사각형 -# 각 꼭짓점의 합이 최대가 되는 정사각형을 찾는 문제 - -n, m = map(int, input().split()) - -arr = [] -for i in range(n) : - arr.append(list(map(int, input()))) - -answer = 1 -# 모든 좌표를 탐색한다 -for i in range(n) : - for j in range(m) : - # 50미만까지 - for k in range(1, 50): - # 두 가지를 모두 충족할 때 - if i + k < n and j + k < m : - n == arr[i][j] - - if n == arr[i + k][j] and n == arr[i][j + k] and n == arr[i + k][j + k] : - # n x m 최대값 크기 출력 - answer = max(answer, (k + 1) ** 2) - -print(answer) From 53089c66098f1e6496ca2a2d2ba8a7fe0de02ce2 Mon Sep 17 00:00:00 2001 From: Noori <93557885+loveitall@users.noreply.github.com> Date: Mon, 13 Feb 2023 08:05:57 +0900 Subject: [PATCH 4/4] =?UTF-8?q?[bj=201051]=20=EC=88=AB=EC=9E=90=20?= =?UTF-8?q?=EC=A0=95=EC=82=AC=EA=B0=81=ED=98=95?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- recursion/bj1051.py | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 recursion/bj1051.py diff --git a/recursion/bj1051.py b/recursion/bj1051.py new file mode 100644 index 0000000..8821aa0 --- /dev/null +++ b/recursion/bj1051.py @@ -0,0 +1,25 @@ +# 1051번 - 숫자 정사각형 +# 각 꼭짓점의 합이 최대가 되는 정사각형을 찾는 문제 + +n, m = map(int, input().split()) + +arr = [] +for _ in range(n) : + arr.append(list(map(int, input()))) + +ans = 1 + +# 모든 좌표를 탐색한다 +for i in range(n) : + for j in range(m) : + # 50미만까지 + for k in range(1, 50): + # 두 가지를 모두 충족할 때 + if i + k < n and j + k < m : + new = arr[i][j] + + if new == arr[i + k][j] and new == arr[i][j + k] and new == arr[i + k][j + k] : + # n x m 최대값 크기 출력 + ans = max(ans, (k + 1) ** 2) + +print(ans)