일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- linear dependence
- Big Theta
- matrix-vector product
- 코틀린 시작하기
- Big Omega
- Big-Oh notation
- 랜덤 순서 배열
- NumPy
- python
- matrix fo a linear transformation
- 이진 탐색
- 알고리즘 분석의 실례
- one-to-one
- nonhomogeneous linear system
- matrix trnasformations
- 빅오메가
- Big-O 예제
- 빅세타
- itertools
- 빅오 표기법
- 코틀린 Hello World!
- 배열 섞기
- trivial solution
- 재귀함수
- recursive algorithms
- Big-Oh 예제
- 일차변환
- nontrivial solution
- homogeneous linear system
- solutions of matrix equation
- Today
- Total
코딩 연습
In a triangular array of positive and negative integers, we wish to find a sub-triangle such that the sum of the numbers it contains is the smallest possible. In the example below, it can be easily verified that the marked triangle satisfies this condition having a sum \(-42\). We wish to make such a triangular array with one thousand rows, so we generate \(500500\) pseudo-random numbers \(s_k\)..
Looking at the table below, it is easy to verify that the maximum possible sum of adjacent numbers in any direction (horizontal, vertical, diagonal or anti-diagonal) is \(16\; (=8+7+1)\). −25329−6513273−18−4 8 Now, let us repeat the search, but on a much larger scale: First, generate four million pseudo-random numbers using a specific form of what is known as a "Lagged Fibonacci Generator": For ..
We can easily verify that none of the entries in the first seven rows of Pascal's triangle are divisible by \(7\): 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 1 However, if we check the first one hundred rows, we will find that only \(2361\) of the \(5050\) entries are not divisible by \(7\). Find the number of entries which are not divisible by \(7\) in the first one billion \(\l..