Cod sursă (job #812431)

#include <iostream>
#include <unordered_map>

using namespace std;
//ifstream cin("loto.in");
//ofstream cout("loto.out");
int per,n;
int v[1000];
int main()
{
    cin>>n>>per;
    for(int i=1;i<=n;i++)
    {
        cin>>v[i];

    }
    while(1)
    {
        if(per>=n)
        { int cnt=1;

            if(v[n]==n-1)
            {
                for(int i=n;i>2;i--)
                  {
                      v[i]=v[i-1];
                  }
                  v[2]=n-1;





                while(v[n]==n-cnt)
                {


                  for(int i=1;i<n;i++)
                  {
                      if(v[i]==n-cnt-1)
                      {
                          swap(v[i],v[i+1]);
                          break;
                      }
                  }


                }
            }
            else
            {

                per-=n;
                for(int i=1;i<=n;i++)
                {
                    if(v[i]==n-1)
                    {

                        swap(v[i],v[i+1]);
                        break;
                    }
                }
            }
        }
        else
        {
            break;
        }

        for(int i=1;i<=n;i++)
        {
            cout<<v[i]<<" ";
        }
        cout<<'\n';
    }


    return 0;
}





4 2 1 3
V
4 3 1 2