probleme 18.01

#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int v[2023];
int main()
{
    short C;
    int n;
    f>>C>>n;
    int i, j;
    for (i=1; i<=n; ++i)
        f>>v[i];
    if (C==1)
    {
        int minn=INT_MAX;
        for (i=1; i<=n; ++i)
            if (v[i]<minn)
                minn=v[i];
        for (i=1; i<=n; ++i)
            if (v[i]==minn)
            {
                ++n;
                for (j=n-1; j>=i+1; --j)
                    v[j+1]=v[j];
                v[i+1]=2*minn;
                ++i;
            }
        for (i=1; i<=n; ++i)
            g<<v[i]<<" ";
    }
    else  if (C==2)
    {
        int minn, maxx, poz;
        for (i=1; i<n; ++i)
        {
            minn=v[i], maxx=v[i], poz=i;
            if (v[i]%2==0)
            {
                for (j=i+1; j<=n; ++j)
                    if (v[j]%2==0 && v[j]<minn)
                        minn=v[j], poz=j;
                if (i!=poz)
                    swap(v[i],v[poz]);
            }
            else
            {
                for (j=i+1; j<=n; ++j)
                    if (v[j]%2==1 && v[j]>maxx)
                        maxx=v[j], poz=j;
                if (i!=poz)
                    swap(v[i],v[poz]);
            }
        }
        for (i=1; i<=n; ++i)
            g<<v[i]<<" ";

    }
    else if (C==3)
    {
        for (i=1; i<=n; ++i)
        {
            if (v[i]==-1)
            {
                ++n;
                for (j=n-1; j>=i+1; --j)
                    v[j+1]=v[j];
                v[i+1]=1;
                ++i;

                ++n;
                for (j=n-1; j>=i+1; --j)
                    v[j+1]=v[j];
                v[i+1]=2;
                ++i;

                ++n;
                for (j=n-1; j>=i+1; --j)
                    v[j+1]=v[j];
                v[i+1]=3;
                ++i;
            }
        }
        for (i=1; i<=n; ++i)
            g<<v[i]<<" ";
    }
    else if (C==4)
    {
        for (i=1; i<=n; ++i)
        {
            if (v[i]%2==0)
            {
                ++n;
                for (j=n-1; j>=i; --j)
                    v[j+1]=v[j];
                v[i]=-v[i];
                ++i;
            }
        }
        for (i=1; i<=n; ++i)
            g<<v[i]<<" ";
    }
    else if (C==5)
    {
        int x;
        for (i=1; i<=n; ++i)
        {
            if (v[i]%2==1)
            {
                x=v[i]%9;
                if (x==0)
                    x=9;

                ++n;
                for (j=n-1; j>=i; --j)
                    v[j+1]=v[j];
                v[i]=x, ++i;

                ++n;
                for (j=n; j>=i+1; --j)
                    v[j+1]=v[j];
                v[i+1]=x, ++i;
            }
        }
        for (i=1; i<=n; ++i)
            g<<v[i]<<" ";
    }
    else if (C==6)
    {
        int x=n;
        for (i=1; i<=n/2; ++i)
            swap(v[i],v[x]), --x;
        for (i=1; i<=n; ++i)
            g<<v[i]<<" ";
    }
    else if (C==7)
    {
        int x=0, cn=n;
        for (i=1; i<=n; ++i)
        {
            if (v[i]==-3)
            {
                ++x;
                for (j=i; j<=n-1; ++j)
                    v[j]=v[j+1];
            --n, --i;
            }
        }
        for (i=x+1; i<=cn; ++i)
            v[i]=-3;
        for (i=1; i<=cn; ++i)
            g<<v[i]<<" ";
    }

    return 0;
}

+