145032025-01-12 21:04:48csdavidKombináció (50)cpp17Runtime error 34/501ms508 KiB
#include <iostream>
using namespace std;

int n, m;

void write(int a[]){
    for(int i=0; i<m; i++){
        cout << a[i] << ' ';
    }
    cout << '\n';
}

void kovetkezo(int a[]){
    int i=m-1;
    while(a[i+1]-a[i]==1){
        i--;
    }
    a[i]++;
    for(i=i+1; i<m; i++){
        a[i]=a[i-1]+1;
    }
    write(a);
    a[i]--;
}

void elozo(int a[]){
    int i=m-1;
    while(i>0&&a[i]-a[i-1]==1){
        i--;
    }
    a[i]--;
    for(i=i+1; i<m; i++){
        a[i]=n-m+i+1;
    }
    write(a);
}

int main(){
    cin >> n >> m;
    int a[m+1], b[m+1];
    for(int i=0; i<m; i++){
        cin >> a[i];
        b[i]=a[i];
    }
    a[m]=n+1;
    b[m]=n+1;
    elozo(a);
    kovetkezo(b);
}
SubtaskSumTestVerdictTimeMemory
base34/50
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Runtime error0/21ms500 KiB
4Accepted2/21ms316 KiB
5Partially correct1/21ms316 KiB
6Runtime error0/21ms316 KiB
7Accepted2/21ms316 KiB
8Runtime error0/21ms316 KiB
9Partially correct1/21ms316 KiB
10Runtime error0/41ms336 KiB
11Accepted4/41ms316 KiB
12Accepted4/41ms508 KiB
13Accepted4/41ms508 KiB
14Runtime error0/41ms316 KiB
15Accepted4/41ms316 KiB
16Accepted6/61ms316 KiB
17Accepted6/61ms348 KiB