CodeTestPractice/Developthird.py at main · rgodragon/CodeTestPractice · 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
55
56
57
58
59
60
61
62
63
64
65
66
# horizon=['a','b','c','d','e','f','g','h']
# vertical=[1,2,3,4,5,6,7,8]

inputs = list(input())

horizon = inputs[0]
vertical = inputs[1]
possibleMaxCount = 8

# print(input[0], input[1])

directions = ['RRU', 'RRD', 'LLU', 'LLD', 'UUR', 'UUL', 'DDR', 'DDL']
unable_horizon = False
unable_vertical = False

# if(horizon == 'a')
# if(horizon == 'b')
# if(horizon == 'g')
# if(horizon == 'h')

for direction in directions:
    if (horizon == 'a' and 'L' in direction): unable_horizon = True
    if (horizon == 'b' and 'LL' in direction): unable_horizon = True
    if (horizon == 'g' and 'RR' in direction): unable_horizon = True
    if (horizon == 'h' and 'R' in direction): unable_horizon = True

    if (vertical == '1' and 'U' in direction): unable_vertical = True
    if (vertical == '2' and 'UU' in direction): unable_vertical = True
    if (vertical == '7' and 'DD' in direction): unable_vertical = True
    if (vertical == '8' and 'D' in direction): unable_vertical = True
    #print(direction, unable_horizon, unable_vertical)

    if (unable_horizon or unable_vertical): possibleMaxCount -= 1
    unable_horizon = False
    unable_vertical = False

print(possibleMaxCount)

# mysite = 'Site name is webisfree.'
# if 'webisfre' in mysite:
#     print('Okay')


### 풀이
# 나이트의 현재 위치
inputData = input()
column = int(ord(inputData[0]) - int(ord('a')))+1
row = int(inputData[1])
count = 0

# 이동 가능한 스텝
steps =[(-2, -1), (-2, 1), (2, -1), (2, 1), (1, -2), (1, 2), (-1, 2), (-1, -2)]

# 8가지 이동 방향 가능한지 확인

for step in steps:
  next_row = row + step[0]
  next_column = column + step[1]

  if next_row<1 or next_row>8 or next_column<1 or next_column>8 :
    continue
  else :
    count+=1

print(count)