230221 [ํ๋ก๊ทธ๋๋จธ์ค ํ๊ฒ ๋๋ฒ]
์ฌ๊ท๋ฅผ ์ด์ฉํ 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
Programming/ํ๋ก๊ทธ๋๋จธ์ค
2023. 9. 2. 17:05
230221 [ํ๋ก๊ทธ๋๋จธ์ค ์์ ๋ง๋ค๊ธฐ]
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
Programming/ํ๋ก๊ทธ๋๋จธ์ค
2023. 9. 2. 17:03
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- Today
- Yesterday
๋งํฌ
TAG
- SKTECHSUMMIT
- AIRUSH
- DALLE
- ๊ธฐ์ ์ปจํผ๋ฐ์ค
- ์คํ ์ด๋ธ๋ํจ์
- C์ธ์ด
- ํ์ด์ฌ์ฝํ
- ๋๋ฆผ๋ถ์ค
- ์ฝํ
- ๊ตฌ๊ธ์ฝ๋ฉ
- WGAN
- ์ฝ๋ฉ์๋ฌ
- StableDiffusion
- Aimers
- SQL
- HyperCLOVA
- gan
- ์ฝํ ์ค๋น
- dreambooth
- MYSQL
- AI์ปจํผ๋ฐ์ค
- ํ ํฌ์๋ฐ
- ์ฝ๋ฉ๊ณต๋ถ
- lgaimers
- CLOVAX
- ๋ ผ๋ฌธ์ฝ๊ธฐ
- AIRUSH2023
- ํ๋ก๊ทธ๋๋จธ์ค
- ํ์ด์ฌ
- ๋ ผ๋ฌธ๋ฆฌ๋ทฐ
์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
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 |
๊ธ ๋ณด๊ดํจ