// [1,2,3,4,5,6,7,8]
// [1]
// []
// Golang - Go - pomoika

// stack
// heap

// array -- const-size(const-capacity)
// slice -- dynamic-size(dynamic-capacity)

func main() {
    arr := [10]int{1,2,3,4,5,6,7,8,9,10}
    var arr [10]int

    	// ReadLn()
	// Read()
	arr := [10]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
	for i := len(arr) - 1; i >= 0; i-- {
		fmt.Printf("%d ", arr[i])
	}
	fmt.Println()
	for i := 0; i < len(arr); i++ {
		fmt.Printf("%d ", arr[i])
	}
	// 1 2 3 4 5 6 7 8 9
	// 9 ............. 1
	// 9 8 ..........2 1
	// 9 8 7 ......3 2 1
	// 9 8 7 6 ... 4 3 2 1
	// 9 8 7 6 5 4 3 2 1
	// 0(0) 0(1) 0(2) 0(3) 0(4) 0(5) 0(6) 0(7) 0(8)
	// 9 8 7 6 5 4 3 2 1
	for i := 0; i < len(arr)/2; i++ {
		arr[i], arr[len(arr)-i-1] = arr[len(arr)-i-1], arr[i]
	}
	fmt.Println(arr)
}

func rotate(nums []int, k int)  {
    k %= len(nums)
    newArr := make([]int, len(nums))
    for i := 0; i < len(nums) - k; i++ {
        newArr[i+k] = nums[i]
    }
    j := 0
    for i := len(nums) - k; i < len(nums); i++ {
        newArr[j] = nums[i]
        j++
    }
    for i := 0; i < len(nums); i++ {
        nums[i] = newArr[i]
    }
}

func rotate(nums []int, k int)  {
    k %= len(nums)
    for i := 0; i < k; i++ {
        tmp := nums[len(nums) - 1]
        for j := len(nums) - 1; j >= 1; j-- {
            nums[j] = nums[j - 1]
        }
        nums[0] = tmp
    }
}

func reverse(nums []int, start, end int) {
    for start < end {
        nums[start], nums[end] = nums[end], nums[start]
        start++
        end--
    }
}

func rotate(nums []int, k int)  {
    k %= len(nums)
    reverse(nums, 0, len(nums) - 1)
    reverse(nums, 0, k - 1)
    reverse(nums, k, len(nums) - 1)
}

func main() {
	// [1,2,3,4,5,6,7,8,9,10]
	// [[1,2,3],[4,5,6],[7,8,9]] // DVUMERNIY MASSIV
	// [[[1,2,3],[4]], [[5,6], [7,8]], [[9]] // TREKHMERNIY MASSIV
	arr := [8][7][5][6]int{}
	for i := 0; i < len(arr); i++ {
		// arr[i] -> array
		// arr[i] -> length
		for j := 0; j < len(arr[i]); j++ {
			for k := 0; k < len(arr[i][j]); k++ {
				for l := 0; l < len(arr[i][j][k]); l++ {
					fmt.Printf("%d", arr[i][j][k][l])
				}
				fmt.Println()
			}
			fmt.Println()
		}
		fmt.Println()
	}
}


func main() {
	// [1,2,3,4,5,6,7,8,9,10]
	// [[1,2,3],[4,5,6],[7,8,9]] // DVUMERNIY MASSIV
	// [[[1,2,3],[4]], [[5,6], [7,8]], [[9]] // TREKHMERNIY MASSIV
	arr := [6][7]int{}
	sum := 0
	for i := 0; i < len(arr); i++ {
		for j := 0; j < len(arr[i]); j++ {
			arr[i][j] = sum
			sum++
		}
	}
	for i := 0; i < len(arr); i++ {
		for j := 0; j < len(arr[i]); j++ {
			fmt.Printf("i=%d, j=%d, elem=%d ", i, j, arr[i][j])
		}
		fmt.Println()
	}
	for i := 0; i < len(arr); i++ {
		for j := 0; j < len(arr[i]); j++ {
			fmt.Printf("%d ", arr[i][j])
		}
		fmt.Println()
	}
}

// You can edit this code!
// Click here and start typing.
package main

import "fmt"

func main() {
	// [1,2,3,4,5,6,7,8,9,10]
	// [[1,2,3],[4,5,6],[7,8,9]] // DVUMERNIY MASSIV
	// [[[1,2,3],[4]], [[5,6], [7,8]], [[9]] // TREKHMERNIY MASSIV
	arr := [7][7]int{}
	sum := 0
	for i := 0; i < len(arr); i++ {
		for j := 0; j < len(arr[i]); j++ {
			sum++
			arr[i][j] = sum
		}
	}
	for i := 0; i < len(arr); i++ {
		for j := 0; j < len(arr[i]); j++ {
			fmt.Printf("%d ", arr[i][j])
		}
		fmt.Println()
	}

	fmt.Println("\n\n\n")
	// [i, i]
	for i := 0; i < len(arr); i++ {
		fmt.Printf("%d ", arr[i][i])
	}
	fmt.Println("\n\n\n")
	// [len(arr) - i - 1; i] || reverse([i][len(arr) - i - 1])
	for i := len(arr) - 1; i >= 0; i-- {
		fmt.Printf("%d ", arr[i][len(arr)-i-1])
	}
}

package main

import "fmt"

func main() {
	// [1,2,3,4,5,6,7,8,9,10]
	// [[1,2,3],[4,5,6],[7,8,9]] // DVUMERNIY MASSIV
	// [[[1,2,3],[4]], [[5,6], [7,8]], [[9]] // TREKHMERNIY MASSIV
	arr := [7][7]int{}
	sum := -1
	for i := 0; i < len(arr); i++ {
		for j := 0; j < len(arr[i]); j++ {
			sum++
			arr[i][j] = sum
		}
	}
	for i := 0; i < len(arr); i++ {
		for j := 0; j < len(arr[i]); j++ {
			fmt.Printf("%d ", arr[i][j])
		}
		fmt.Println()
	}
	// Ищем число N(39)
	// i = N / 7; j = N % 7; [N / 7][N % 7]
	// i = 3, j = 2; i * 7 + j + STARTING_ELEM(0) => 21 + 2 + 0 => 23
}

func linearSearch() {
	arr := [5]int{4, 5, 7, 1, 2}
	target := 1
	for i := 0; i < len(arr); i++ {
		if arr[i] == target {
			fmt.Println("YES")
		}
	}

    if cap(arr) > len(arr) {
        arr = append(arr, target)
        barrierLinearSearch()
    } else {
        linearSearch()
    }
}

func barrierLinearSearch() {
	// [1,2,3,4,5,6,7], target = 19
	// [1,2,3,4,5,6,7,19], target = 19
	target := 19
	arr := []int{1, 2, 3, 19, 5, 6, 7}
	oldLen := len(arr)
	arr = append(arr, target)
	i := 0
	for arr[i] != target {
		i++
	}
	fmt.Println(i < oldLen)
}

// You can edit this code!
// Click here and start typing.
package main

import "fmt"

func main() {
	arr := []int{1, 2, 3, 4, 5, 6, 7, 8} // target = 8
	for i := 0; i < len(arr); i++ {
		if (arr[i] & (arr[i] - 1)) == 0 {
			fmt.Println(arr[i])
		}
	}
}

// You can edit this code!
// Click here and start typing.
package main

import "fmt"

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func main() {
	arr := []int{1, 3, 7, 2, 19, 6, 15, 4, 11} // target = 10
	target := 10
	result := arr[0]
	minDiff := abs(arr[0] - target)
	for i := 1; i < len(arr); i++ { // O(N)
		curr := arr[i]
		currDiff := abs(curr - target)
		if currDiff < minDiff {
			result = arr[i]
			minDiff = currDiff
		}
	}
	fmt.Println(result)
}

// You can edit this code!
// Click here and start typing.
package main

import "fmt"

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func main() {
	arr := []int{1, 3, 7, 2, 19, 6, 15, 4, 11} // target = 10
	max := arr[0]
	for i := 1; i < len(arr); i++ { // O(N);
		if arr[i] > max {
			max = arr[i]
		}
	}
	result := arr[0]
	for i := 0; i < len(arr); i++ { // O(N*k)
		if result < arr[i] && arr[i] != max {
			result = arr[i]
		}
	} // O(N * N) -> O(N^2)
	fmt.Println(result)
}


func main() {
	arr := []int{1, 2, 3, 4, 5, 6, 7, 8}

	for i := 0; i < 10000; i++ {
		currElem := arr[i%len(arr)]
		fmt.Println(currElem)
	}
}