SW Expert Academy_D4 6959, 4613, 6109, 1211

 1
 2
 3
 4
 5
 6
 7
 8
 9
10

for T in range(int(input())):
    N = input()
    result = ["A", "B"]
    turn = 1
    while len(N) > 1:
        N = str(int(N[0]) + int(N[1])) + N[2:]
        turn += 1
    print(f'#{T+1} {result[turn%2]}')
    
# 단순 산수

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19

for T in range(int(input())):
    N, M = map(int, input().split())
    a = [input() for _ in range(N)]
    result = N * M

    for i in range(1, N - 1):
        for j in range(1, N - i):
            count = 0
            for x in range(N):
                if 0 <= x < i:
                    count += M - a[x].count('W')
                elif i <= x < i + j:
                    count += M - a[x].count('B')
                else:
                    count += M - a[x].count('R')
            if result > count:
                result = count

    print(f'#{T+1} {result}')

 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

from collections import deque

def turn():
    tmp = [[0] * N for _ in range(N)]
    for i in range(N):
        for j in range(N):
            tmp[i][j] = arr[N-1-j][i]
    return tmp

def push():
    for y in range(N):
        q = deque([])
        for x in range(N):
            if arr[x][y] != 0:
                q.append(arr[x][y])
                arr[x][y] = 0
        i = 0
        while q:
            if len(q) >= 2:
                a, b = q.popleft(), q.popleft()
                if a == b:
                    arr[i][y] = a+b
                else:
                    arr[i][y] = a
                    q.appendleft(b)
                i += 1        
            else:
                arr[i][y] = q.popleft()
    
direction = {'up': (0, 0), 'left': (1, 3), 'down': (2, 2), 'right': (3, 1)}

for T in range(int(input())):
    N, S = input().split()
    N = int(N)
    
    arr = [list(map(int, input().split())) for _ in range(N)]
    Front, Back = direction[S]

    for i in range(Front):
        arr = turn()

    push()

    for i in range(Back):
        arr = turn()

    print(f'#{T+1}')
    for i in arr:
        print(*i)

# 하... 너무 오래 걸렸다.
# 방향 전환이 싫어서 U, D, R, L를
# 각각 구현해봤으나.. 실패하고.
# 수정해야 할 것도 너무 많아지고..
# 방향 전환 구현하니까.. 이리 저리 돌리는 숫자 
# 생각하는데 또 오래 걸리고...ㅎ

 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

dx = [0, 0, 1]
dy = [1, -1, 0]

def IsSafe(x, y):
    if 0 <= x < 100 and 0 <= y < 100:
        return True

def DFS(x, y):
    global distance
    if x == 99:
        return distance
    
    visited[x][y] = 1
    for i in range(3):
        nx = x + dx[i]
        ny = y + dy[i]
        if IsSafe(nx, ny) and arr[nx][ny] == 1 and visited[nx][ny] == 0:
            distance += 1
            DFS(nx, ny)
            return distance  # 런타임 오류 방지로 재귀를 빠져나올 때 무조건 리턴.

for _ in range(10):
    T = int(input())
    arr = [list(map(int, input().split())) for _ in range(100)]
    
    Min = 10000
    Midx = 0
    for y in range(100):
        if arr[0][y] == 1:
            visited = [[0]* 100 for _ in range(100)]
            distance = 0
            v = DFS(0, y)
            if v <= Min:
                Min = v
                Midx = y
    print(f'#{T} {Midx}')