| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- 알고리즘 분석의 실례
- one-to-one
- 코틀린 시작하기
- linear dependence
- python
- Big-O 예제
- NumPy
- 페이지 겹칩
- 빅오메가
- 빅오 표기법
- matrix fo a linear transformation
- 일차변환
- Big-Oh notation
- itertools
- includepdf
- nonhomogeneous linear system
- 랜덤 순서 배열
- nontrivial solution
- matrix trnasformations
- 재귀함수
- homogeneous linear system
- 이진 탐색
- 빅세타
- 배열 섞기
- recursive algorithms
- Big-Oh 예제
- 코틀린 Hello World!
- Big Theta
- trivial solution
- Big Omega
- Today
- Total
코딩 연습
Using a combination of black square tiles and oblong tiles chosen from: red tiles measuring two units, green tiles measuring three units, and blue tiles measuring four units, it is possible to tile a row measuring five units in length in exactly fifteen different ways. How many ways can a row measuring fifty units in length be tiled? 길이 1인 정사각형 모양의 검은색 타일과 길이 2인 직사각형 모양의 빨간색 타일, 길이 3인 직사각형 모양의 초..
A row of five black square tiles is to have a number of its tiles replaced with colored oblong tiles chosen from red (length two), green (length three), or blue (length four). If red tiles are chosen there are exactly seven ways this can be done. If green tiles are chosen there are three ways. And of blue tiles are chosen there are two ways. Assuming that colors cannot be mixed there are 7+3+2=1..
Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 133468. Similarly if no digit is exceeded by the digit to its right it is called a decreasing number; for example, 66420. We shall call a positive integer that is neither increasing nor decreasing a "bouncy" number; for example, 155349. As \(n\) increases, the proportion of..