225702026-01-15 11:24:35zazabakerKombináció (50)cpp17Wrong answer 38/501ms508 KiB
#include <iostream>

using namespace std;

int n,m,i,j;
int x[105];
int elozo[105],kov[105];

int main()
{
    cin >>n>>m;
    for (i=1; i<=m;i++)
        cin >>x[i];


    bool van=false;
    for (i=m;i>=1;i--)
    {
        if ( (i == 1 && x[i] > 1) || (i > 1 && x[i] > x[i-1] + 1) )

        {
            for (j=1;j<i;j++)
                elozo[j]=x[j];

            elozo[i]=x[i]-1;

            for (j=i+1;j<=m;j++)
                elozo[j] = elozo[j-1] + 1;


            van=true;
            break;
        }
    }


    if (!van)
    {
        for (i=1;i<=m;i++)
            elozo[i]=n-m+i;
    }

    for (i=1;i<=m;i++)
        cout<<elozo[i]<<" ";
    cout <<endl;


    van=false;
    for (i=m;i>=1;i--)
    {
        if (x[i]<n-(m-i))
        {
            for (j=1;j<i;j++)
                kov[j]=x[j];

            kov[i]=x[i]+1;

            for (j=i+1;j<=m;j++)
                kov[j]=kov[j-1]+1;

            van=true;
            break;
        }
    }


    if (!van)
    {
        for (i=1;i<=m;i++)
            kov[i]=i;
    }

    for (i=1;i<=m;i++)
        cout<<kov[i]<<" ";

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base38/50
1Accepted0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Partially correct1/21ms316 KiB
7Partially correct1/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms348 KiB
10Partially correct2/41ms316 KiB
11Partially correct2/41ms508 KiB
12Accepted4/41ms316 KiB
13Accepted4/41ms316 KiB
14Accepted4/41ms316 KiB
15Accepted4/41ms316 KiB
16Partially correct3/61ms316 KiB
17Partially correct3/61ms316 KiB