| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- C
- IFileDialog
- algorithm
- 오블완
- GeeksForGeeks
- UE5
- DeferredRendering
- Frustum
- C++
- softeer
- 줄 세우기
- 프로그래머스
- DirectX11
- UnrealEngine4
- 2294
- Programmers
- 백준
- UnrealEngine5
- 팰린드롬 만들기
- Unreal Engine5
- NRVO
- const
- directx
- 1563
- baekjoon
- RVO
- 언리얼엔진5
- RootMotion
- winapi
- 티스토리챌린지
- Today
- Total
목록Algorithm (584)
Game Develop
https://www.acmicpc.net/problem/25418 무난한 연습용으로 풀만한 문제. Bottom-Up방식으로 풀던가, 규칙을이용해 최적화해서 최대 logN번으로 풀 수 있는 방법이 있다. Bottom-Up12345678910111213141516171819202122232425262728293031323334353637383940414243#include iostream>#include string>#include map>#include vector>#include algorithm>#include math.h>#include queue>#include functional>#include sstream>#include memory.h>#include deque>#include set..
https://www.acmicpc.net/problem/2613 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156..
https://www.acmicpc.net/problem/1072 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970#include iostream>#include string>#include map>#include vector>#include algorithm>#include math.h>#include queue>#include functional>#include sstream>#include memory.h>#include deque>#include set>#include unordered_map>#include s..
https://www.acmicpc.net/problem/25121234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586#include iostream>#include string>#include map>#include vector>#include algorithm>#include math.h>#include queue>#include functional>#include sstream>#include memory.h>#include deque>#include set>#in..
https://www.acmicpc.net/problem/20500 1234567891011121314151617181920212223242526272829303132333435363738394041424344#include iostream>#include string>#include map>#include vector>#include algorithm>#include math.h>#include queue>#include functional>#include sstream>#include memory.h>#include deque>#include set>#include unordered_map>#include stack>#include numeric> using namespace std; const in..
https://www.acmicpc.net/problem/2591 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768#include iostream>#include string>#include map>#include vector>#include algorithm>#include math.h>#include queue>#include functional>#include sstream>#include memory.h>#include deque>#include set>#include unordered_map>#include stack>..
https://www.acmicpc.net/problem/2643 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283#include iostream>#include string>#include map>#include vector>#include algorithm>#include math.h>#include queue>#include functional>#include sstream>#include memory.h>#include deque>#include set>#include..
https://www.acmicpc.net/problem/2662 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586#include iostream>#include string>#include map>#include vector>#include algorithm>#include math.h>#include queue>#include functional>#include sstream>#include memory.h>#include deque>#include set>#..