141842025-01-10 08:30:01szabelrKombináció (50)cpp17Wrong answer 21/501ms508 KiB
#include <iostream>

using namespace std;

int main()
{
    int n,m,x,le=0;
    cin>>n>>m;
    int sor[m+1]{0};
    int sore[m+1]{0};

    for(int i=1; i<=m; i++){
        cin>>x;
        sor[i]=x;
        sore[i]=x;
    }
    //kisebb
    for(int i=m; i>0; i--){
        if(sor[i]>0){
            sor[i]--;
            break;
        }
        else
            le++;
    }
    if(le!=0){
        for(int i=m-le+1; i<=m; i++){
            sor[i]=n;
        }
    }
    for(int i=1; i<=m; i++){
        cout<<sor[i]<<" ";
    }
    cout<<endl;
    //nagyobb
    le=0;
    for(int i=m; i>0; i--){
        if(sore[i]<n){
            sore[i]++;
            break;
        }
        else
            le++;
    }
    if(le!=0){
        for(int i=m-le+1; i<=m; i++){
            sore[i]=n;
        }
    }
    for(int i=1; i<=m; i++){
        cout<<sore[i]<<" ";
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base21/50
1Accepted0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Partially correct1/21ms316 KiB
4Accepted2/21ms316 KiB
5Partially correct1/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Partially correct1/21ms316 KiB
8Wrong answer0/21ms508 KiB
9Partially correct1/21ms316 KiB
10Wrong answer0/41ms316 KiB
11Wrong answer0/41ms316 KiB
12Accepted4/41ms316 KiB
13Accepted4/41ms316 KiB
14Wrong answer0/41ms316 KiB
15Accepted4/41ms316 KiB
16Wrong answer0/61ms316 KiB
17Partially correct3/61ms316 KiB