python-study/6.py at main · LucyMoon/python-study · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
# def dfs(v):
#     visited[v] = 1
#     print(v, end=' ')
#     for i in graph[v]:
#         if not visited[i]:
#             dfs(i)
#
# graph = [
#     [],
#     [2,3,8],
#     [1,7],
#     [1,4,5],
#     [3,5],
#     [3,4],
#     [7],
#     [2,6,8],
#     [1,7]
# ]
# visited = [0] * 9
# dfs(1)


# n, m = map(int, input().split())
# graph = []
# for i in range(n):
#     graph.append(list(map(int, input())))
#
#
# def puddle(x, y):
#     if x <= -1 or x >= n or y <= -1 or y >= m:
#         return False
#     if graph[x][y] == 0:
#         graph[x][y] = 1
#         puddle(x - 1, y)
#         puddle(x, y - 1)
#         puddle(x + 1, y)
#         puddle(x, y + 1)
#         return True
#     else:
#         return False
#
#
# cnt = 0
# for i in range(n):
#     for j in range(m):
#         if puddle(i, j) == True:
#             cnt += 1
#
# print(cnt)

a = int(input())
a.s123ort()
print(a[-1])