From f95cef7fd009186f186b4b5e281b0ce0692bee47 Mon Sep 17 00:00:00 2001 From: Andrew Date: Thu, 4 Apr 2019 19:36:04 +0400 Subject: =?UTF-8?q?=D0=9F=D0=B5=D1=80=D0=B2=D0=B0=D1=8F=20=D0=B4=D0=BE?= =?UTF-8?q?=D0=BF=D0=BE=D0=BB=D0=BD=D0=B8=D1=82=D0=B5=D0=BB=D1=8C=D0=BD?= =?UTF-8?q?=D0=B0=D1=8F=20=D0=B7=D0=B0=D0=B4=D0=B0=D1=87=D0=B0?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- day2.5/task1/task1.py | 45 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 day2.5/task1/task1.py (limited to 'day2.5/task1/task1.py') diff --git a/day2.5/task1/task1.py b/day2.5/task1/task1.py new file mode 100644 index 0000000..f7ce690 --- /dev/null +++ b/day2.5/task1/task1.py @@ -0,0 +1,45 @@ +n = int(input()) +RIGHT, DOWN, LEFT, UP = range(4) + +matrix = [[0 for _ in range(n)] for _ in range(n)] + +current = [0, 0] +direction = RIGHT + +for i in range(1, n ** 2 + 1): + matrix[current[1]][current[0]] = i + + if direction == RIGHT: + if current[0] + 1 >= n or matrix[current[1]][current[0] + 1] != 0: + direction = DOWN + current[1] += 1 + else: + current[0] += 1 + + elif direction == DOWN: + if current[1] + 1 >= n or matrix[current[1] + 1][current[0]] != 0: + direction = LEFT + current[0] -= 1 + else: + current[1] += 1 + + elif direction == LEFT: + if current[0] - 1 < 0 or matrix[current[1]][current[0] - 1] != 0: + direction = UP + current[1] -= 1 + else: + current[0] -= 1 + + elif direction == UP: + if current[1] - 1 < 0 or matrix[current[1] - 1][current[0]] != 0: + direction = RIGHT + current[0] += 1 + else: + current[1] -= 1 + + +# Переводим все числа в строки и делаем их необходимой длины, чтобы вывод был наглядным +# Длина, до которой дополняем все числа, точно будет равна длине самого большого числа в матрице +maxlen = len(str(n ** 2)) +for row in matrix: + print(*map(lambda num: str(num).rjust(maxlen, ' '), row)) -- cgit v1.2.3