ํ๋ก๊ทธ๋๋จธ์ค ์ธ๊ณต์ง๋ฅ ๋ฐ๋ธ์ฝ์ค ์ฝํ def solution(seat): seat.sort() length = len(seat) dp = [0] * length target = None for i in range(length): if seat[i] != target: dp[i] = 1 target = seat[i] else: continue return sum(dp)
[WHERE] + ์กฐ๊ฑด๋ฌธ SELECT ANIMAL_ID, NAME FROM ANIMAL_INS WHERE INTAKE_CONDITION != 'Aged' ๊ฐ์ ์กฐ๊ฑด๋ฌธ ๊ฒ์ฌ๋ == ๊ฐ ์๋ =๋ฅผ ์ด๋ค! SELECT ANIMAL_ID, NAME FROM ANIMAL_INS WHERE INTAKE_CONDITION = 'Sick' [ORDER BY] ์ด๋ฆ๊ธฐ์ค ์ ๋ ฌ, ์ด๋ฆ์ด ๊ฐ์ ๊ฒฝ์ฐ ๋์ค์ ๋ณดํธํ ๊ธฐ๊ฐ ์ ๋๋ก ์ ๋ ฌ SELECT ANIMAL_ID, NAME, DATETIME FROM ANIMAL_INS ORDER BY NAME ASC, DATETIME DESC ์ญ์ ์ ๋ ฌํ๊ธฐ → DESC ์ฌ์ฉ SELECT NAME, DATETIME FROM ANIMAL_INS ORDER BY ANIMAL_ID DESC DATE..
์ฌ๊ท๋ฅผ ์ด์ฉํ DFS๋ก ํ์๋๋ฐ ํธ์ถ ๋ถ๋ถ์ด ์ดํด๊ฐ ์ ์๋จ ใ ๋ค์ ๋ด์ผ๊ฒ ์ import sys sys.setrecursionlimit(1000000) def solution(numbers, target): n = len(numbers) cnt = 0 def DFS(index, sum): if index == n: if sum == target: nonlocal cnt cnt+=1 return else: DFS(index+1, sum+numbers[index]) DFS(index+1, sum-numbers[index]) DFS(0,0) return cnt
from itertools import combinations def solution(nums): cnt = 0 arr = list(map(sum, combinations(nums, 3))) for i in arr: flag = 0 for j in range(2, int(i ** 0.5)+1): if i % j == 0: flag = 1 break if flag == 0: cnt += 1 return cnt
์ฌ๋ฐฉ๋ฉด์ ๊ฐ์ ์๊น ์๋์ง ๊ฒ์ฌ DFS ๊ทธ๋ฅ DFS ‘R’์ ‘G’๋ก ๋ฐ๊พธ๊ณ DFS ํ๋ฒ ๋ import sys from collections import deque sys.setrecursionlimit(1000000) input = sys.stdin.readline def DFS(x, y): dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] visited[y][x] = 1 for i in range(4): nowx, nowy = x+dx[i], y+dy[i] if 0
- 2606 ์ ์ญ๋ณ์๋ฅผ ์ฌ์ฉํด์ cnt๊ฐ์ ์ฒดํฌํ๋๋ผ ์ ๋จน์๋๋ฐ ๊ตณ์ด ๊ทธ๋ด ํ์๊ฐ ์์๋ค ์ด์ฐจํผ ๋ฐฉ๋ฌธํ ๊ฐ์ visited์ ์ ์ฅํ๊ธฐ ๋๋ฌธ์ sum(visited) -1 ํด์ฃผ๋ฉด ๋๋ ๊ฒ! *์๊ฐ์ ์ ํ ์๊ฐ์ ๋ฐ์!! import sys from collections import deque input = sys.stdin.readline N = int(input().rstrip()) M = int(input().rstrip()) graph = [[0]*(N+1) for i in range(N+1)] visited = [0]*(N+1) for i in range(M): n1, n2 = map(int, input().rstrip().split()) graph[n1][n2] = graph[n2][n1] = 1..
True → 1, False → 0 ๋ก ๊ตฌํ import sys from collections import deque input = sys.stdin.readline # N : ์ ์ ๊ฐ์, M : ๊ฐ์ ๊ฐ์, V : ํ์์์์ N, M, V = map(int, input().rstrip().split()) # ์ธ์ ํ๋ ฌ์ ๋ชจ๋ 0์ผ๋ก ๊ตฌ์ฑ matrix = [[0]*(N+1) for i in range(N+1)] #๋ฐฉ๋ฌธํ ๊ณณ ์ฒดํฌ ๋ฆฌ์คํธ ์ ์ ๊ฐฏ์๋งํผ ํฌ๊ธฐ ๊ตฌ์ฑ visited_dfs = [0]*(N+1) visited_bfs = [0]*(N+1) # ๊ฐ์ ๊ฐฏ์ ๋งํผ ์ ๋ ฅ๋ฐ๊ธฐ, ์ ๋ ฅ๋ฐ๋ ๊ฐ์ ๋ํด ์ํ๋ ฌ์ 1 ์ฝ์ -> ์ธ์ ๋ฆฌ์คํธ ์์ฑ for i in range(M): n1, n2 = map(int, input(..
์์ ๋ฌธ์ ์ ๋น์ทํ๊ฒ for๋ฌธ ๋๊ฐ๋ฅผ ์ฌ์ฉํด์ ํ๋ฉด ์๊ฐ์ด๊ณผ๊ฐ ๋ฌ๋ค ‘์๋ผํ ์คํ ๋ค์ค์ ์ฒด’๋ฅผ ์ด์ฉํด์ ์ฝ๋๋ฅผ ์์ฑํด์ผ ํ๋ค. ์๊ฐ์ ์ค์ด๊ธฐ ์ํด 2๋ถํฐ i๊น์ง ๋ค ๊ฒ์ฌํ๋ ๊ฒ์ด๋ผ ์๋๋ผ, 2๋ถํฐ i์ ์ ๊ณฑ๊ทผ(๋ฃจํธ)๊น์ง๋ง ๊ฒ์ฌํ๋ฉด ๋๋ค. import sys N, M = map(int, sys.stdin.readline().rstrip().split()) prime_num = [] for i in range(N, M+1): flag = 0 if i == 1 : continue # 1์ ์์๊ฐ X for j in range(2, int(i**0.5) + 1): if i % j == 0: flag = 1 break if flag == 0: prime_num.append(i) print(*prime_num, se..
- Total
- Today
- Yesterday
- Aimers
- dreambooth
- ๋ ผ๋ฌธ์ฝ๊ธฐ
- ์ฝํ
- ์ฝ๋ฉ์๋ฌ
- MYSQL
- AI์ปจํผ๋ฐ์ค
- ํ์ด์ฌ
- DALLE
- ํ๋ก๊ทธ๋๋จธ์ค
- AIRUSH
- ํ ํฌ์๋ฐ
- ์ฝ๋ฉ๊ณต๋ถ
- CLOVAX
- ์ฝํ ์ค๋น
- WGAN
- ๊ตฌ๊ธ์ฝ๋ฉ
- StableDiffusion
- ๋ ผ๋ฌธ๋ฆฌ๋ทฐ
- AIRUSH2023
- ๋๋ฆผ๋ถ์ค
- HyperCLOVA
- ๊ธฐ์ ์ปจํผ๋ฐ์ค
- ํ์ด์ฌ์ฝํ
- SKTECHSUMMIT
- lgaimers
- gan
- SQL
- C์ธ์ด
- ์คํ ์ด๋ธ๋ํจ์
์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
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 |