![](http://i1.daumcdn.net/thumb/C148x148/?fname=https://blog.kakaocdn.net/dn/k6rBa/btsyPAGZXIE/PUdKkaTIxOLgpBFB3kpuK0/img.png)
์๋ ํ์ธ์. ์ค๋์ openai ์ฌ์ gpt๊ฐ ์๋ ๋ค๋ฅธ ์ธ๊ณต์ง๋ฅ ๋ชจ๋ธ์ ์ฌ์ฉํด๋ณด๊ฒ ์ต๋๋ค. DALL-E 2 : OpenAI์์ ๋ง๋ Text-to-Image AI ๋ชจ๋ธ AI๋ฅผ ๊ธฐ๋ฐ์ผ๋ก ํ๋กฌํํธ์์ ํ ์คํธ๋ฅผ ์ ๋ ฅ์ผ๋ก ๋ฐ์ ์ด๋ฏธ์ง๋ฅผ ์์ฑํด์ฃผ๋ ์ธ๊ณต์ง๋ฅ ๋ชจ๋ธ DALL·E 2 DALL·E 2 is an AI system that can create realistic images and art from a description in natural language. openai.com DALL-E 2 API ์ฌ์ฉํ๊ธฐ 1. OpenAI์์ APIํค๋ฅผ ๋ฐ๊ธ ๋ฐ์์ผํจ 2. API๋ฅผ ๋ฐ๊ธ ๋ฐ๊ณ ๋๋ฉด import openai๋ก api๋ฅผ ์ฌ์ฉํ ์ ์์ 3. ์๋ ์ฝ๋์์ prompt์ ์ด๋ฏธ์ง ์์ฑ์ ์ํ๋ ๋ฌธ์ฅ์ ์ ๋ ฅํด์ฃผ๋ฉด..
์ฝ๋ฆฐ์ด ํ๋ฌ๋์ ์ง์ง ์ด์ฌํํ์ - PS ๋ง์ด๋ ๊ฐค๋ฌ๋ฆฌ ํ์ด์ฌ (Python) ์์ฃผ ์ฌ์ฉ๋๋ ๋ฌธ์์ด ํจ์ (์ฝ๋ฉํ ์คํธ, ์๊ณ ๋ฆฌ์ฆ) [python] ์์ n์งธ ์๋ฆฌ๊น์ง ์ถ๋ ฅํ๊ธฐ (round(), %, format(), f-string) [python] ์์์ ๋ฐ์ฌ๋ฆผ, ์ฌ๋ฆผ, ๋ด๋ฆผํ๋ ์ฝ๋ Python - ๋ฆฌ์คํธ์ ์ฒซ๋ฒ์งธ ์์ ์ ๊ฑฐ Python - ๋ฌธ์์ด์ ํ ๊ธ์์ฉ ๋ถ๋ฆฌํ์ฌ ๋ฆฌ์คํธ์ ๋ฃ๊ธฐ [python] ๋ฆฌ์คํธ ๊ฐ์ ์ ๋ถ 0์ผ๋ก ์ด๊ธฐํ ํ๋ ๋ฒ(+ํน์ ๊ฐ์ผ๋ก ์ด๊ธฐํ) 150๋ฌธ์ ๋ก ์์ง ๊ฐ์ด ์ ์ ์ค์ค์ ์์ด์, ๋ฌธ์ ์๋ฅผ ๋๋ฆฌ์๋ฉด์ ์์ด๋์ด๋ ๋ฌธ์ ํด๊ฒฐ๋ฅ๋ ฅ์ KOI, USACO ๋ฌธ์ ์ ์ ํ์ด๋ณด์ธ์ - dc App2021.05.18 14:49:07 ใ ใ (118.235)๊ฐ์ฌํฉ๋๋ค ๊ณต๋ถํ๋ฉด์ koi ์ด๋ฑ๋ถ ๋ฌธ์ ์..
import sys from collections import deque input = sys.stdin.readline T = int(input().rstrip()) for i in range(T): k = int(input().rstrip()) n = int(input().rstrip()) people = [i for i in range(1, n+1)] # 0์ธต # 1์ธต 3ํธ 6๋ช 2์ธต์ 3ํธ 10๋ช for j in range(k): apt = [] for l in range(n): apt.append(sum(people[:l+1])) people = apt.copy() print(people) print(people[-1])
import sys from collections import deque input = sys.stdin.readline N, K = map(int, input().rstrip().split()) P = list(input().rstrip().split()) visited = set("".join(P)) q = deque([["".join(P),0]]) ans = -1 while(q): word, cnt = q.popleft() # ๋จ์ด, ๋จ์ด๋ฅผ ๋ฐ๊พผ ํ์ tmpP = list(word) if tmpP == sorted(tmpP): ans = cnt break isFrist = False for i in range(N-K+1): newP = list(tmpP) targetP = newP[i:i+K] ta..
https://www.acmicpc.net/problem/1012 #DFS ํ์ด import sys from collections import deque sys.setrecursionlimit(1000000) def DFS(x, y): dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] for i in range(4): nowx = x + dx[i] nowy = y + dy[i] if (0
ํ๋ก๊ทธ๋๋จธ์ค ์ธ๊ณต์ง๋ฅ ๋ฐ๋ธ์ฝ์ค ์ฝํ 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
- Total
- Today
- Yesterday
- CLOVAX
- AI์ปจํผ๋ฐ์ค
- ๊ตฌ๊ธ์ฝ๋ฉ
- MYSQL
- ๋๋ฆผ๋ถ์ค
- ํ ํฌ์๋ฐ
- ์ฝ๋ฉ์๋ฌ
- lgaimers
- ๋ ผ๋ฌธ์ฝ๊ธฐ
- ์ฝํ ์ค๋น
- Aimers
- ํ์ด์ฌ
- WGAN
- DALLE
- ๊ธฐ์ ์ปจํผ๋ฐ์ค
- ์คํ ์ด๋ธ๋ํจ์
- ์ฝ๋ฉ๊ณต๋ถ
- ๋ ผ๋ฌธ๋ฆฌ๋ทฐ
- ์ฝํ
- AIRUSH2023
- C์ธ์ด
- dreambooth
- SKTECHSUMMIT
- ํ๋ก๊ทธ๋๋จธ์ค
- HyperCLOVA
- AIRUSH
- SQL
- ํ์ด์ฌ์ฝํ
- gan
- StableDiffusion
์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
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 |