c2

1sem/adaptation courses/07/21.cpp

@@ -0,0 +1,21 @@
+// ac_7_21.cpp
+// Горбацевич Андрей
+#include <iostream>
+using namespace std;
+
+int main() {
+    int N;
+    cout << "N >>>";
+    cin >> N;
+    int *A = new int[N];
+    for (int i = 0; i < N; i++) {
+        cout << "A[" << i << "] >>>";
+        cin >> *(A + i);
+    }
+
+    cout << "A = ";
+    for (int i = 0; i < N; i++) {
+        cout << *(A + i) << " ";
+    }
+    return 0;
+}

1sem/adaptation courses/07/22.cpp

@@ -0,0 +1,30 @@
+// ac_7_22.cpp
+// Горбацевич Андрей
+#include <iostream>
+#include <ctime>
+using namespace std;
+
+int main() {
+    srand(time(nullptr) / 2);
+
+    int N;
+    cout << "N >>>";
+    cin >> N;
+    int *rez = new int[N];
+    int *data = new int[100]();
+    for (int i = 0; i < N; i++) {
+        *(rez + i) = 1 + rand() % 100 + 1;
+    }
+    for (int i = 0; i < N; i++) {
+        *(data + (*(rez + i) - 1)) += 1;
+    }
+    cout << "rez = ";
+    for (int i = 0; i < N; i++) {
+        cout << *(rez + i) << " ";
+    }
+    cout << endl << endl;
+    for (int i = 0; i < 100; i++) {
+         cout << "Count of `" << i + 1 << "`: " << *(data + i) << endl;
+    }
+    return 0;
+}

1sem/adaptation courses/07/23.cpp

@@ -0,0 +1,54 @@
+// ac_7_23.cpp
+// Горбацевич Андрей
+#include <iostream>
+
+using namespace std;
+
+int *get_array(size_t size);
+void print_array(const int *arr, size_t size);
+size_t remove_zeros(int *arr, size_t n);
+
+int main()
+{
+    size_t len;
+    cout << "Input length >>>";
+    cin >> len;
+    cout << "Input array >>>";
+    int *arr = get_array(len);
+    size_t zc = remove_zeros(arr, len);
+    cout << "Zeros count: " << zc << endl;
+    cout << "Resulting array: ";
+    print_array(arr, len-zc);
+}
+
+int *get_array(size_t size) {
+    int *array = new int[size]();
+    for (size_t i = 0; i < size; i++) {
+        cin >> *(array + i);
+    }
+    return array;
+}
+
+void print_array(const int *arr, size_t size) {
+    for (size_t i = 0; i < size; i++) {
+        cout << *(arr + i) << " ";
+    }
+    cout << endl;
+}
+
+size_t remove_zeros(int *arr, size_t n) {
+    size_t out = 0;
+    bool flag;
+    do {
+        flag = false;
+        for (size_t i = 0; i < n-1; i++) {
+            if (*(arr + i) == 0 && *(arr + i + 1) != 0) {
+                swap(*(arr + i), *(arr + i + 1));
+                out++;
+                flag = true;
+                break;
+            }
+        }
+    } while (flag);
+    return out;
+}