All restored

Author: Benzogang-Tape

Courses/Data structures & algorithms(VK Education open course)/1.2.1.cpp

@@ -0,0 +1,26 @@
+//
+// Created by DJ Tape on 15.02.2024.
+//
+#include <iostream>
+
+size_t find_elem(const int array[], size_t arr_size, int element) {
+	size_t counter{};
+	for (size_t i{}; i < arr_size; ++i){
+		if (array[i] != element)
+			counter++;
+	}
+	return counter;
+}
+
+
+int main() {
+	size_t arrSize{};
+	std::cin >> arrSize;
+	int *array = new int[arrSize], elem{};
+	for (size_t i{}; i < arrSize; ++i)
+		std::cin >> array[i];
+	std::cin >> elem;
+	std::cout << find_elem(array, arrSize, elem);
+	delete[] array;
+	return 0;
+}

Courses/Data structures & algorithms(VK Education open course)/1.2.2.cpp

@@ -0,0 +1,37 @@
+//
+// Created by DJ Tape on 15.02.2024.
+//
+#include <iostream>
+
+void sort_bad_marks(int array[], size_t arr_size) {
+	for (size_t i{}; i < arr_size; ++i){
+		if (array[i] == 0) {
+			size_t amount_of_Zero{ 1 };
+			for(size_t j = i + 1; j < arr_size; ++j) {
+				if (array[j] != 0 or j == arr_size - 1)
+					break;
+				amount_of_Zero++;
+			}
+			for (size_t k = i + amount_of_Zero; k < arr_size; ++k) {
+				array[k - amount_of_Zero] = array[k];
+			}
+			for (size_t l{}; l < amount_of_Zero; ++l) {
+				array[arr_size - l - 1] = 0;
+			}
+		}
+	}
+}
+
+
+int main() {
+	size_t arrSize{};
+	std::cin >> arrSize;
+	int *array = new int[arrSize];
+	for (size_t i{}; i < arrSize; ++i)
+		std::cin >> array[i];
+	sort_bad_marks(array, arrSize);
+	for (size_t i{}; i < arrSize; ++i)
+		std::cout << array[i] << ' ';
+	delete[] array;
+	return 0;
+}

Courses/Data structures & algorithms(VK Education open course)/1.3.1.cpp

@@ -0,0 +1,31 @@
+//
+// Created by DJ Tape on 15.02.2024.
+//
+#include <iostream>
+
+void InsertionSort(int arr[], const size_t arrSize) {
+	for (int i = 1; i < arrSize; ++i) {
+		int currentElem = arr[i];
+		int j = i - 1;
+		while (j >= 0 and arr[j] > currentElem) {
+			arr[j + 1] = arr[j];
+			j--;
+		}
+		arr[j + 1] = currentElem;
+	}
+}
+
+int main(){
+	size_t arrSize{};
+	std::cin >> arrSize;
+	int* array = new int[arrSize];
+	for (size_t i{}; i < arrSize; ++i) {
+		std::cin >> array[i];
+	}
+	InsertionSort(array, arrSize);
+	for (size_t i{}; i < arrSize; ++i) {
+		std::cout << array[i] << ' ';
+	}
+	delete[] array;
+	return 0;
+}

Courses/Data structures & algorithms(VK Education open course)/1.4.1.cpp

@@ -0,0 +1,44 @@
+//
+// Created by DJ Tape on 15.02.2024.
+//
+#include <iostream>
+
+void Merge(int arr[], size_t begin, size_t mid, size_t end) {
+	int* helpArr = new int[end + 1];
+	for (size_t i = begin; i < mid + 1; ++i)
+		helpArr[i] = arr[i];
+	for (size_t i = mid + 1; i < end + 1; ++i)
+		helpArr[i] = arr[i];
+	size_t i = begin, j = mid + 1, k = begin;
+	while (i < mid + 1 or j < end + 1) {
+		if (i < mid + 1 and (helpArr[i] < helpArr[j] or j >= end + 1))
+			arr[k++] = helpArr[i++];
+		else
+			arr[k++] = helpArr[j++];
+	}
+	delete[] helpArr;
+}
+
+void MergeSort(int arr[], size_t begin, size_t end) {
+	if (begin >= end)
+		return;
+	size_t mid = begin + ((end - begin) / 2);
+	MergeSort(arr, begin, mid);
+	MergeSort(arr, mid + 1, end);
+	Merge(arr, begin, mid, end);
+}
+
+
+int main() {
+	size_t arrSize{};
+	std::cin >> arrSize;
+	int* array = new int[arrSize];
+	for (size_t i{}; i < arrSize; ++i) {
+		std::cin >> array[i];
+	}
+	MergeSort(array, 0, arrSize - 1);
+	for (size_t i; i < arrSize; ++i) {
+		std::cout << array[i] << ' ';
+	}
+	delete[] array;
+}

Courses/Data structures & algorithms(VK Education open course)/1.4.2.cpp

@@ -0,0 +1,53 @@
+//
+// Created by DJ Tape on 15.02.2024.
+//
+#include <iostream>
+#include <vector>
+#include <iomanip>
+
+struct Book {
+	std::string ISBN{};
+	std::string title{};
+	unsigned publicationYear{};
+};
+
+void Merge(std::vector<Book>& books, size_t begin, size_t mid, size_t end) {
+	std::vector<Book> helpArr(end + 1);
+	for (size_t i = begin; i < mid + 1; ++i)
+		helpArr[i] = books[i];
+	for (size_t i = mid + 1; i < end + 1; ++i)
+		helpArr[i] = books[i];
+	size_t i = begin, j = mid + 1, k = begin;
+	while (i < mid + 1 or j < end + 1) {
+		if (i < mid + 1 and (helpArr[i].publicationYear < helpArr[j].publicationYear or j >= end + 1))
+			books[k++] = helpArr[i++];
+		else if (helpArr[i].publicationYear == helpArr[j].publicationYear)
+			books[k++] = helpArr[i].title < helpArr[j].title ? helpArr[i++] : helpArr[j++];
+		else
+			books[k++] = helpArr[j++];
+	}
+}
+
+void MergeSort(std::vector<Book>& books, size_t begin, size_t end) {
+	if (begin >= end)
+		return;
+	size_t mid = begin + ((end - begin) / 2);
+	MergeSort(books, begin, mid);
+	MergeSort(books, mid + 1, end);
+	Merge(books, begin, mid, end);
+}
+
+
+int main() {
+	size_t amount_of_books{};
+	std::cin >> amount_of_books;
+	std::vector<Book> books(amount_of_books);
+	for (auto& book : books) {
+		std::cin >> book.ISBN >> std::quoted(book.title) >> book.publicationYear;
+	}
+	MergeSort(books, 0, books.size() - 1);
+	for (const auto& book : books) {
+		std::cout << book.ISBN << ' ' << std::quoted(book.title) << ' ' << book.publicationYear << std::endl;
+	}
+	return 0;
+}

Courses/Data structures & algorithms(VK Education open course)/2.1.1.cpp

@@ -0,0 +1,27 @@
+//
+// Created by DJ Tape on 15.02.2024.
+//
+#include <iostream>
+
+
+int FindLastEvenElem(size_t arrSize = {}) {
+	/* Дан массив не отсортированных целых чисел. Написать функцию, которая вернет первое с конца четное число.
+	 * При написании кода используйте принцип стека. Если массив не содержит четного числа возвращать -1.*/
+
+	int lastEven{ -1 };
+	for (size_t i{}; i < arrSize; ++i) {
+		int currentElem{};
+		std::cin >> currentElem;
+		if (currentElem % 2 == 0)
+			lastEven = currentElem;
+	}
+	return lastEven;
+}
+
+
+int main() {
+	size_t arrSize{};
+	std::cin >> arrSize;
+	std::cout << FindLastEvenElem(arrSize);
+	return 0;
+}

Courses/Data structures & algorithms(VK Education open course)/CMakeLists.txt

@@ -1 +1,8 @@
+add_executable(1.2.1 1.2.1.cpp)
+add_executable(1.2.2 1.2.2.cpp)
+add_executable(1.3.1 1.3.1.cpp)
+add_executable(1.4.1 1.4.1.cpp)
+add_executable(1.4.2 1.4.2.cpp)
+add_executable(module1_test module1_test.cpp)
+add_executable(2.1.1 2.1.1.cpp)
 add_executable(2.1.2 2.1.2.cpp)

Courses/Data structures & algorithms(VK Education open course)/module1_test.cpp

@@ -0,0 +1,39 @@
+//
+// Created by DJ Tape on 15.02.2024.
+//
+#include <iostream>
+
+void MoveEven(int arr[], size_t arrSize) {
+	size_t nextEvenIndex{};
+	for (size_t i{}; i < arrSize; ++i) {
+		if (arr[i] % 2 == 0) {
+			nextEvenIndex++;
+			continue;
+		}
+	}
+	for (size_t i{}; i < arrSize; ++i) {
+		if (arr[i] % 2 == 0)
+			continue;
+		for (size_t j = i + 1; j < arrSize; ++j) {
+			if (arr[j] % 2 == 0) {
+				std::swap(arr[i], arr[j]);
+				break;
+			}
+		}
+	}
+}
+
+
+int main() {
+	size_t arrSize{};
+	std::cin >> arrSize;
+	int* array = new int[arrSize];
+	for (size_t i{}; i < arrSize; ++i) {
+		std::cin >> array[i];
+	}
+	MoveEven(array, arrSize);
+	for (size_t i{}; i < arrSize; ++i) {
+		std::cout << array[i] << ' ';
+	}
+	delete[] array;
+}

Problems/Study AI/CMakeLists.txt

@@ -1 +1,5 @@
+add_executable(meeting_of_friends meeting_of_friends.cpp)
+add_executable(string_conversion string_conversion.cpp) #Not Solved yet
+add_executable(another_one_game_with_the_string another_one_game_with_the_string.cpp)
+add_executable(berland_parliament berland_parliament.cpp)
 add_executable(party party.cpp)

Problems/Study AI/another_one_game_with_the_string.cpp

@@ -0,0 +1,36 @@
+// https://codeforces.com/contest/1480/problem/A?locale=ru
+
+// Не проходит тесты на Study AI
+
+#include <iostream>
+#include <vector>
+#include <string>
+
+void StringConversion(std::string &input) {
+	for (size_t letter{}; letter < input.length(); ++letter){
+		input[letter] = (!(letter % 2)) ? input[letter] == 'a' ? 'b' : 'a' : input[letter] == 'z' ? 'y' : 'z';
+	}
+}
+
+int main() {
+	size_t n{};
+	std::cin >> n;
+
+//    std::vector<std::string> inputs(n);
+//    for(auto& input : inputs) {
+//        std::cin >> input;
+//    }
+//    for(auto& input : inputs){
+//        StringConversion(input);
+//        std::cout << input << std::endl;
+//    }
+//
+
+	for(size_t i{}; i < n; ++i) {
+		std::string input{};
+		std::cin >> input;
+		StringConversion(input);
+		std::cout << input << std::endl;
+	}
+	return 0;
+}

Problems/Study AI/berland_parliament.cpp

@@ -0,0 +1,75 @@
+// https://codeforces.com/contest/644/problem/A?locale=ru
+#include <iostream>
+
+void CanSitOut(size_t n, size_t a, size_t b) {
+	if (n > a * b) {
+		std::cout << -1;
+		return;
+	}
+	size_t counter = 1;
+	if (b % 2) {
+		for (size_t i{}; i < a; ++i) {
+			for (size_t j{}; j < b; ++j) {
+				if (counter > n) {
+					std::cout << 0 << ' ';
+				} else {
+					std::cout << counter << ' ';
+					counter++;
+				}
+			}
+			std::cout << std::endl;
+		}
+	}
+	else {
+		for (size_t i{}; i < a; ++i) {
+			if (i % 2) {
+				for (size_t j{}; j < b; j += 2) {
+					if (counter > n) {
+						std::cout << 0 << ' ' << 0 << ' ';
+					}
+					else {
+						std::cout << ((counter + 1 > n) ? 0 : counter + 1) << ' ';
+						counter++;
+						std::cout << counter - 1 << ' ';
+						counter++;
+					}
+				}
+			}
+			else {
+				for (size_t j{}; j < b; ++j) {
+					if (counter > n) {
+						std::cout << 0 << ' ';
+					} else {
+						std::cout << counter << ' ';
+						counter++;
+					}
+				}
+			}
+			std::cout << std::endl;
+		}
+	}
+}
+
+int main() {
+	size_t n{}, a{}, b{};
+	std::cin >> n >> a >> b;
+	CanSitOut(n, a, b);
+	return 0;
+}
+
+/*
+void CanSitOut(size_t n, size_t a, size_t b) {
+    if (a * b < n) {
+        std::cout << -1;
+        return;
+    }
+
+    for (size_t i = 0; i < a; ++i) {
+        for (size_t j = 0; j < b; ++j) {
+            size_t seatNumber = i * b + (i % 2 == 0 ? j : b - j - 1) + 1;
+            std::cout << (seatNumber <= n ? seatNumber : 0) << ' ';
+        }
+        std::cout << std::endl;
+    }
+}
+*/