좌충우돌 IT이야기

https://school.programmers.co.kr/learn/courses/30/lessons/133027?language=oracle

-- 코드를 입력하세요
SELECT
FLAVOR
FROM
(
    SELECT
    A.FLAVOR
    ,NVL(A.TOTAL_ORDER,0) + NVL(B.TOTAL_ORDER,0) AS RESULT
    FROM FIRST_HALF A, 
    (
        SELECT
        FLAVOR
        ,SUM(TOTAL_ORDER) AS TOTAL_ORDER
        FROM JULY
        GROUP BY FLAVOR
    )B
    WHERE 1=1
    AND A.FLAVOR = B.FLAVOR(+)
    ORDER BY 2 DESC
) WHERE ROWNUM < 4;

import sys
sys.setrecursionlimit(10**9)
sys.stdin = open("input.txt")

input = sys.stdin.readline


n, m, r = map(int, input().split())

node = [[]for _ in range(n+1)]

for i in range(m):
    u, v = map(int, input().split())
    node[u].append(v)
    node[v].append(u)

for j in range(n+1):
    node[j].sort()

def dfs(v):
    global cnt
    visited[v] = cnt
    for i in node[v]:
        if not visited[i]:
            cnt+=1
            dfs(i)

cnt = 1

visited = [0] * (n + 1)
dfs(r)

for _ in range(1, n+1):
    print(visited[_])

n, m, v = map(int, input().split())
node = [[] for _ in range(n+1)]

for i in range(m):
    a, b = map(int, input().split())
    node[a].append(b)
    node[b].append(a)

for j in range(n+1):
    node[j].sort()

def dfs(v):
    visited1[v] = True
    print(v, end=' ')
    for i in node[v]:
        if not visited1[i]:
            dfs(i)


visited1 = [False] * (n+1)
dfs(v)

print()



from collections import deque

def bfs(v):
    queue = deque()
    queue.append(v)
    visited[v] = True

    while queue:
        v = queue.popleft()
        print(v, end= ' ')
        for i in node[v]:
            if not visited[i]:
                queue.append(i)
                visited[i] = True

visited = [False] * (n+1)
bfs(v)

n = int(input())
cnt = 0

while n >= 0:
    if n % 5 == 0:
        cnt += n // 5
        break
    else:
        n -= 3
        cnt += 1
else:
    cnt = -1

print(cnt)