Task 1

#include <iostream>
using namespace std;
int find_max(int* ar, int len) {
    int maxEl = *ar;
    for (int i = 1; i < len; ++i)
        if (*(ar + i) > maxEl)
            maxEl = *(ar + i);
    return maxEl;
}
void fill_array(int* ar, int len) {
    for (int i = 0; i < len; ++i)
        cin >> *(ar + i);
}
void mul_elements(int* ar, int len, int maxEl) {
    for (int i = 0; i < len; ++i)
        *(ar + i) *= maxEl;
}
void print_array(int* ar, int len) {
    for (int i = 0; i < len; ++i)
        cout << *(ar + i) << ' ';
    cout << endl;
}
int main() {
    int n;
    cout << "Enter size of arrays\n";
    cin >> n;
    int* A = new int[n];
    int* B = new int[n];

    cout << "Enter " << n << " elements of A array\n"; fill_array(A, n);
    cout << "Enter " << n << " elements of B array\n"; fill_array(B, n);

    cout << "Original array A\n";
    print_array(A, n);
    cout << "Original array B\n";
    print_array(B, n);

    int maxA = find_max(A,n), maxB = find_max(B,n);
    mul_elements(A, n, maxA); mul_elements(B, n, maxB);


    cout << "Modified array A\n";
    print_array(A, n);
    cout << "Modified array B\n";
    print_array(B, n);

    delete[] A;
    delete[] B;

    return 0;
}