Tema 17.09.2019

#include <iostream>

using namespace std;


void nule (int[], int);
void shift (int[], int);
void  p (int[], int, int&, int&, int&);

int main()
{
    int pb;
    cout<<"pb:"; cin>>pb;
    switch(pb){
        case 1:{//Var 20, Sub.3, Pb.3
            int n;
            cout<<"n="; cin>>n;
            int v[n];
            for (int i=0; i<n; i++) cin>>v[i];
            nule (v, n);
            for (int i=0; i<n; i++) cout<<v[i]<<" ";
            break;
        }
        case 2:{//Var 23, Sub.3, Pb.3
            int n, x;
            cout<<"n="; cin>>n;
            cout<<"x="; cin>>x;
            int v[n], new_v[n];
            for (int i=0; i<n; i++) cin>>v[i];
            for (int i=0; i<n; i++) new_v[i]=v[i];
            shift (v, x);
            cout<<"Tabloul permutat este:"<<endl;
            for (int i=0; i<n; i++) cout<<v[i]<<" ";
            cout<<endl;
            cout<<"Tabloul inversat este:"<<endl;
            for (int i=0; i<n; i++)
                shift(new_v, n-i);
            for (int i=0; i<n; i++) cout<<new_v[i]<<" ";
            break;
        }
        case 3:{//Var 24, Sub.3, Pb.3
            int n;
            cout<<"n="; cin>>n;
            int v[n];
            for (int i=0; i<n; i++) cin>>v[i];
            int maxi, mini, sum;
            p(v, n, mini, maxi, sum);
            cout<<"Suma elementelor este:"<<sum<<endl;
            cout<<"Elementul maxim este:"<<maxi<<endl;
            cout<<"Elementul minim este:"<<mini<<endl;
            float ma=(sum-maxi-mini)*1.0/(n-2);
            cout<<"Media aritmetica este:"<<ma;
            break;
        }
    }
    return 0;
}

void nule (int v[], int n){
    int k=n-1;
    for (int i=0; i<n; i++)
        if (v[i]==0 && i<k)
            swap (v[i], v[k--]);
    for (int i=0; i<n; i++)
        if (v[i]==0 && i<k)
            swap (v[i], v[k--]);
}

void shift (int v[], int x){
    int k=v[0];
    for (int i=0; i<x; i++)
        v[i]=v[i+1];
    v[x-1]=k;
}

void p (int v[], int n, int &mini, int  &maxi, int &sum){
    sum=0;
    maxi=-1;
    mini=7000;
    for (int i=0; i<n; i++){
        sum+=v[i];
        if (v[i]>maxi)
            maxi=v[i];
        if (v[i]<mini)
            mini=v[i];
    }
}