일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 빅오메가
- Big Theta
- matrix-vector product
- 이진 탐색
- recursive algorithms
- itertools
- Big-Oh notation
- nontrivial solution
- 코틀린 시작하기
- 일차변환
- Big-O 예제
- linear dependence
- 알고리즘 분석의 실례
- nonhomogeneous linear system
- 빅오 표기법
- matrix trnasformations
- one-to-one
- python
- solutions of matrix equation
- NumPy
- 배열 섞기
- 빅세타
- Big-Oh 예제
- homogeneous linear system
- 재귀함수
- trivial solution
- 랜덤 순서 배열
- 코틀린 Hello World!
- Big Omega
- matrix fo a linear transformation
- Today
- Total
코딩 연습
67번 문제는 다음과 같다. By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23. 3 7 4 2 4 6 8 5 9 3 That is, 3 + 7 + 4 + 9 = 23. Find the maximum total from top to bottom in triangle.txt (right click and 'Save Link/Target As...'), a 15K text file containing a triangle with one-hundred rows. NOTE: It is not possible to try ..
66번 문제는 다음과 같다. Consider quadratic Diophantine equations of the form: x2 – Dy2 = 1 For example, when D=13, the minimal solution in x is 6492 – 13×1802 = 1. It can be assumed that there are no solutions in positive integers when D is square. By finding minimal solutions in x for D = {2, 3, 5, 6, 7}, we obtain the following: 32 – 2×22 = 1 22 – 3×12 = 1 92 – 5×42 = 1 52 – 6×22 = 1 82 – 7×32 = 1 Hen..
문제는 다음과 같다. Each character on a computer is assigned a unique code and the preferred standard is ASCII (American Standard Code for Information Interchange). For example, uppercase A = 65, asterisk (*) = 42, and lowercase k = 107. A modern encryption method is to take a text file, convert the bytes to ASCII, then XOR each byte with a given value, taken from a secret key. The advantage with the XO..