#include <iostream>

using namespace std;

void result(int arr[], int n, int k, int l, int counter) {

for (int i = k; i < n - counter; i++) {
arr[i] = arr[i+ counter];
}
}

int main() {
cout << "working1: ";
int n;
int k;
int l;
int counter;
cin >> n;
cin >> k;
cin >> l;
counter = l - k+1;
int* arr = new int[n];

for (int i = 0; i < n; i++) {

cin >> arr[i];
}

for (int i = 0; i < n; i++) {

cout << arr[i] << " ";
}
result(arr, n, k, l,counter);
cout << endl;
n = n - counter;
for (int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
}

#include <iostream>
using namespace std;
// Дан целочисленный массив размера N. Удалить из массива все нечетные числа и вывести размер
полученного массива и его содержимое.

void result(int arr[], int &n) {

int index = 0;
for (int i = 0; i < n; i++) {
if (arr[i] % 2 == 0) {
arr[index++] = arr[i];

}
}
n = index;

}
int main() {
cout << "working3: ";
int n;
cin >> n;
 int* arr = new int[n];

for (int i = 0; i < n; i++) {

cin >> arr[i];
}

result(arr, n);
for (int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
}

4) void result(int arr[], int &n) {

int N = (n + 1) / 2;
for (int i = 0, j = 0; i < n; i += 2, j++) {
arr[j] = arr[i];
}
n = N;

}
int main() {
cout << "working3: ";
int n;
cin >> n;

int* arr = new int[n];

for (int i = 0; i < n; i++) {

cin >> arr[i];
}

result(arr, n);
for (int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
}

5) void result(int arr[], int &n) {

int N = 1;
for (int i = 1; i < n; i++) {
if (arr[i] != arr[i - 1]) {
arr[N++] = arr[i];
}
}
n = N;

6) void result(int arr[], int &n,int k) {

int N = 1;
for (int i = n; i >= n; i+) {
if (arr[i] == arr[k]) {
arr[i - 1] = 0;
}
}

7) void result(int arr[], int &n) {

int max = 0;
int max_index;
 int min = 0;
int min_index;
int* newArr = new int [n + 2];
for (int i = 0; i < n; i++) {
if (arr[i] > arr[max]) {
max = i;
}
if (arr[i] < arr[min]) {
min = i;
}
}

int newN = 0;
for (int i = 0; i < n; ++i) {
if (i == min) {
newArr[newN++] = 0;
}
newArr[newN++] = arr[i];

if (i == max) {
newArr[newN++] = 0;
}
}
n = newN;
for (int i = 0; i < n; i++) {
cout << newArr[i] << " ";
}
}

8) void result(int arr[], int n, int k, int m) {

int* array = new int[n + m];
int N = n + m;
for (int i = 0; i < n + m; i++) {
if (i < k) {
array[i] = arr[i];
}
else if (i >= k && i < k + m) {
array[i] = 0;
}
else {
array[i] = arr[i - m];
}
}
delete[] arr;
arr = array;
n = N;
for (int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
}

9) int counter = 0;;

for (int i = 0; i < n; i+=2) {
counter++;
}
int size = (counter * 2);
int* array = new int[size];
int N = 0;

for (int i = 0; i < n; i+=2) {

array[N++] = arr[i];
}
 for (int i = 0; i < n; i+=2) {
array[N++] = arr[i];
}
delete[] arr;
arr = array;
n = counter;
10)

void result(int arr[], int n) {

int counter = 0;
for (int i = 0; i < n; i++) {
if (arr[i] < 0) {
counter++;
}
}
int* array = new int[counter + n];
for (int i = 0, j=0; i < n; i++) {
if (arr[i] < 0) {
array[j++] = 0;
}
array[j++] = arr[i];

}
n = counter + n;
for (int i = 0; i < n; i++) {
cout << array[i] << " ";
}

11) #include <iostream>

using namespace std;
int main()
{
int n, N, ser = 0;
cin >> n;
int* arr = new int[n];
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
for (int i = 0; i < n; i++)
{
if ((arr[i] == arr[i + 1]) && (arr[i] != arr[i - 1]))
{
ser++;
}
}
N = n + ser;
int* array = new int[N];
for (int i = 0, j = 0; j < N; i++, j++)
{
if ((arr[i] == arr[i + 1]) && (arr[i] != arr[i - 1]))
{
array[j] = 0;
array[j + 1] = arr[i];
j++;
continue;
}
array[j] = arr[i];
}
 for (int i = 0; i < N; i++)
cout << array[i] << " ";
}
12) void result(int arr[], int n) {
int counter = 1;
int seria = 0;
for (int i = 0; i < n; i++) {
if (arr[i] == arr[i + 1]) {
seria = 1;
}
if (seria == 1) {
counter++;
seria = 0;
}
}
if (counter == 1) {
counter = 0;
}

int* array = new int[n - counter];

int N = 0;
for (int i = 0; i < n; i++) {
bool uni = true;
for (int j = 0; j < N; j++) {
if (arr[i] == array[j]) {
uni = false;
break;
}
}
if (uni) {
array[N++] = arr[i];
}
}
n = abs(counter - n - 1);
for (int i = 0; i < n; i++) {
cout << array[i] << " ";
}
}
13)
void result(int arr[], int n) {
int seria = 0;
int counter = 1;
for (int i = 0; i < n; i++) {
if (arr[i] == arr[i + 1]) {
seria = 1;
}
if (seria == 1) {
counter++;
seria = 0;
}
}
if (counter == 1) {
counter = 0;
}

int* array = new int[n];

int N = 0;b
for (int i = 0; i < n; i++) {
array[N++] = arr[i];
while (i < n && arr[i] == arr[i + 1]) {
 i++;
}
}
n = 1 + n - counter;
for (int i = 0; i < n; i++) {
cout << array[i] << " ";
}
}

void result(int arr[], int n) {

int serial = 0;
for (int i = 0; i < n; i++) {
if (arr[i] == arr[i + 1] and arr[i] != arr[i - 1]) {
serial++;
}
}

int* array = new int[n + serial];

int N = n + serial;

for(int i =0, j=0; j<n;j++){

int k = arr[i];
int tof = false;
while (arr[i] == arr[i + 1]) {
i++;
array[j] = arr[i];
tof = true;
}
if (tof == true) {
j--;
}
if (tof == false) {
array[j] = arr[i];
}
}
for (int i = 0; i < N; i++)
cout << array[i] << " ";
}