module 2 task2 update

README.md

@@ -1,8 +1,7 @@
 # Репозиторий для работ по курсу информатика
 
-Вот сюда нужно будет в первой работе с гитом добавит свое ФИО
-
 ## ФИО
+Пыжов Виктор Владимирович
 
 ## Работа с репозиторием
 

golang/go.mod

@@ -2,4 +2,4 @@ module isuct.ru/informatics2022
 
 go 1.16
 
-require github.com/stretchr/testify v1.8.1 // indirect
+require github.com/stretchr/testify v1.8.1

golang/go.sum

@@ -5,12 +5,12 @@ github.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZb
 github.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=
 github.com/stretchr/objx v0.1.0/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME=
 github.com/stretchr/objx v0.4.0/go.mod h1:YvHI0jy2hoMjB+UWwv71VJQ9isScKT/TqJzVSSt89Yw=
-github.com/stretchr/objx v0.5.0 h1:1zr/of2m5FGMsad5YfcqgdqdWrIhu+EBEJRhR1U7z/c=
 github.com/stretchr/objx v0.5.0/go.mod h1:Yh+to48EsGEfYuaHDzXPcE3xhTkx73EhmCGUpEOglKo=
 github.com/stretchr/testify v1.7.1/go.mod h1:6Fq8oRcR53rry900zMqJjRRixrwX3KX962/h/Wwjteg=
 github.com/stretchr/testify v1.8.0/go.mod h1:yNjHg4UonilssWZ8iaSj1OCr/vHnekPRkoO+kdMU+MU=
 github.com/stretchr/testify v1.8.1 h1:w7B6lhMri9wdJUVmEZPGGhZzrYTPvgJArz7wNPgYKsk=
 github.com/stretchr/testify v1.8.1/go.mod h1:w2LPCIKwWwSfY2zedu0+kehJoqGctiVI29o6fzry7u4=
+gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405 h1:yhCVgyC4o1eVCa2tZl7eS0r+SDo693bJlVdllGtEeKM=
 gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
 gopkg.in/yaml.v3 v3.0.0-20200313102051-9f266ea9e77c/go.mod h1:K4uyk7z7BCEPqu6E+C64Yfv1cQ7kz7rIZviUmN+EgEM=
 gopkg.in/yaml.v3 v3.0.1 h1:fxVm/GzAzEWqLHuvctI91KS9hhNmmWOoWu0XTYJS7CA=

golang/internal/module1/task1.go

@@ -0,0 +1,9 @@
+package module1
+
+import "fmt"
+
+func Task1() {
+	var a, b int
+	fmt.Scanf("%d %d", &a, &b)
+	fmt.Printf("%d", a+b)
+}

golang/internal/module1/task2.go

@@ -0,0 +1,10 @@
+package module1
+
+import "fmt"
+
+func Task2() {
+	var name string
+	fmt.Scanf("%s", &name)
+
+	fmt.Printf("Hello, %s!", name)
+}

golang/internal/module2/task1.go

@@ -0,0 +1,39 @@
+package module2
+
+import (
+	"bufio"
+	"fmt"
+	"os"
+	"strconv"
+	"strings"
+)
+
+func Task1() {
+	var n int
+	fmt.Scanln(&n)
+
+	reader := bufio.NewReader(os.Stdin)
+	line, err := reader.ReadString('\n')
+	if err != nil {
+		panic(err)
+	}
+	line = strings.TrimSuffix(line, "\n")
+	line = strings.TrimSuffix(line, "\r")
+	arr := strings.Split(line, " ")
+
+	p := false
+	for i := 0; i < n-1; i++ {
+		for j := 0; j < n-i-1; j++ {
+			a, _ := strconv.Atoi(arr[j])
+			b, _ := strconv.Atoi(arr[j+1])
+			if a > b {
+				arr[j], arr[j+1] = arr[j+1], arr[j]
+				fmt.Println(strings.Join(arr, " "))
+				p = true
+			}
+		}
+	}
+	if !p {
+		fmt.Println(0)
+	}
+}

golang/internal/module2/task2.go

@@ -0,0 +1,36 @@
+package module2
+
+import (
+	"bufio"
+	"fmt"
+	"os"
+	"strconv"
+	"strings"
+)
+
+func Task2() {
+	scanner := bufio.NewScanner(os.Stdin)
+	var n int
+	fmt.Scanln(&n)
+	arr := make([][]int, n)
+
+	for i := 0; i < n; i++ {
+		scanner.Scan()
+		input := strings.Split(scanner.Text(), " ")
+		input2 := make([]int, 2)
+		input2[0], _ = strconv.Atoi(input[0])
+		input2[1], _ = strconv.Atoi(input[1])
+		arr[i] = input2
+
+		j := i - 1
+		x := arr[i]
+		for j >= 0 && (arr[j][1] < x[1] || arr[j][1] == x[1] && arr[j][0] > x[0]) {
+			arr[j+1] = arr[j]
+			j -= 1
+		}
+		arr[j+1] = x
+	}
+	for _, v := range arr {
+		fmt.Println(v[0], v[1])
+	}
+}

golang/internal/module2/task3.go

@@ -0,0 +1,62 @@
+package module2
+
+import (
+	"bufio"
+	"fmt"
+	"os"
+	"strconv"
+	"strings"
+)
+
+func merge(left, right []int, pos_left int, pos_right int) []int {
+	result := []int{}
+	i, j := 0, 0
+	for i < len(left) && j < len(right) {
+		if left[i] <= right[j] {
+			result = append(result, left[i])
+			i++
+		} else {
+			result = append(result, right[j])
+			j++
+		}
+	}
+	result = append(result, left[i:]...)
+	result = append(result, right[j:]...)
+	// Описывает осуществление слияния, по одному на каждой строке. По условию задачи.
+	fmt.Println(pos_left+1, pos_right+len(right), result[0], result[len(result)-1])
+	return result
+}
+
+func mergeSort(arr []int, pos int) []int {
+	if len(arr) <= 1 {
+		return arr
+	}
+	mid := len(arr) / 2
+	left := mergeSort(arr[:mid], pos)
+	right := mergeSort(arr[mid:], pos+mid)
+	return merge(left, right, pos, pos+mid)
+}
+
+func Task3() {
+	var n int
+	fmt.Scanln(&n)
+
+	reader := bufio.NewReader(os.Stdin)
+	line, err := reader.ReadString('\n')
+	if err != nil {
+		panic(err)
+	}
+	line = strings.TrimSuffix(line, "\n")
+	line = strings.TrimSuffix(line, "\r")
+	arr := strings.Split(line, " ")
+
+	intArr := make([]int, n)
+	for i := 0; i < n; i++ {
+		intArr[i], _ = strconv.Atoi(arr[i])
+	}
+
+	sortedArr := mergeSort(intArr, 0)
+	for _, v := range sortedArr {
+		fmt.Print(v, " ")
+	}
+}

golang/internal/module2/task4.go

@@ -0,0 +1,65 @@
+package module2
+
+import (
+	"bufio"
+	"fmt"
+	"os"
+	"strconv"
+	"strings"
+)
+
+func merge2(left, right []int) ([]int, int) {
+	k := 0
+	result := []int{}
+	i, j := 0, 0
+	for i < len(left) && j < len(right) {
+		if left[i] <= right[j] {
+			result = append(result, left[i])
+			i++
+		} else {
+			result = append(result, right[j])
+			j++
+			k = k + len(left) - i
+		}
+	}
+	result = append(result, left[i:]...)
+	result = append(result, right[j:]...)
+	return result, k
+}
+
+func mergeSort2(arr []int, _ int) ([]int, int) {
+	if len(arr) <= 1 {
+		return arr, 0
+	}
+	mid := len(arr) / 2
+	left, kl := mergeSort2(arr[:mid], 0)
+	right, kr := mergeSort2(arr[mid:], 0)
+	a, k := merge2(left, right)
+	return a, k + kl + kr
+}
+
+func Task4() {
+	var n int
+	fmt.Scanln(&n)
+
+	reader := bufio.NewReader(os.Stdin)
+	line, err := reader.ReadString('\n')
+	if err != nil {
+		panic(err)
+	}
+	line = strings.TrimSuffix(line, "\n")
+	line = strings.TrimSuffix(line, "\r")
+	arr := strings.Split(line, " ")
+
+	intArr := make([]int, len(arr))
+	for i, str := range arr {
+		num, err := strconv.Atoi(str)
+		if err != nil {
+			panic(err)
+		}
+		intArr[i] = num
+	}
+
+	_, count := mergeSort2(intArr, 0)
+	fmt.Println(count)
+}

golang/internal/module2/task5.go

@@ -0,0 +1,19 @@
+package module2
+
+import (
+	"fmt"
+)
+
+func Task5() {
+	var n int
+	fmt.Scan(&n)
+
+	numbers := make(map[int]bool)
+	for i := 0; i < n; i++ {
+		var num int
+		fmt.Scan(&num)
+		numbers[num] = true
+	}
+
+	fmt.Println(len(numbers))
+}

golang/internal/module2/task6.go

@@ -0,0 +1,32 @@
+package module2
+
+import (
+	"fmt"
+)
+
+func Task6() {
+	var n, k int
+	fmt.Scan(&n)
+	products := make([]int, n)
+	for i := 0; i < n; i++ {
+		fmt.Scan(&products[i])
+	}
+
+	fmt.Scan(&k)
+	orders := make([]int, k)
+	for i := 0; i < k; i++ {
+		fmt.Scan(&orders[i])
+	}
+
+	counts := make([]int, n)
+	for _, v := range orders {
+		counts[v-1]++
+	}
+	for i := 0; i < n; i++ {
+		if products[i] < counts[i] {
+			fmt.Println("yes")
+		} else {
+			fmt.Println("no")
+		}
+	}
+}

golang/internal/module2/task7.go

@@ -0,0 +1,77 @@
+package module2
+
+import (
+	"bufio"
+	"fmt"
+	"os"
+	"strconv"
+)
+
+func printArray(arr []string) {
+	n := len(arr)
+	if n == 0 {
+		fmt.Println("empty")
+	} else {
+		for i := 0; i < n-1; i++ {
+			fmt.Printf("%s, ", arr[i])
+		}
+		if n > 0 {
+			fmt.Println(arr[n-1])
+		}
+	}
+}
+
+func radixSort(arr []string) []string {
+	maxArr := 0
+	for _, s := range arr {
+		if len(s) > maxArr {
+			maxArr = len(s)
+		}
+	}
+
+	for i := maxArr - 1; i >= 0; i-- {
+		buckets := make([][]string, 10)
+		for _, s := range arr {
+			if len(s) <= i {
+				buckets[0] = append(buckets[0], s)
+			} else {
+				a, _ := strconv.Atoi(string(s[i]))
+				buckets[a] = append(buckets[a], s)
+			}
+		}
+
+		arr = []string{}
+		for _, bucket := range buckets {
+			arr = append(arr, bucket...)
+		}
+
+		fmt.Println("**********")
+		fmt.Printf("Phase %d\n", maxArr-i)
+		for j, bucket := range buckets {
+			fmt.Printf("Bucket %d: ", j)
+			printArray(bucket)
+		}
+	}
+
+	return arr
+}
+
+func Task7() {
+	scanner := bufio.NewScanner(os.Stdin)
+	scanner.Scan()
+	n, _ := strconv.Atoi(scanner.Text())
+	arr := make([]string, n)
+	for i := 0; i < n; i++ {
+		scanner.Scan()
+		arr[i] = scanner.Text()
+	}
+
+	fmt.Println("Initial array:")
+	printArray(arr)
+
+	sortedArr := radixSort(arr)
+
+	fmt.Println("**********")
+	fmt.Println("Sorted array:")
+	printArray(sortedArr)
+}