[PS][완전탐색][N자리 K진수]/[BOJ][15651][N과 M (2)]/방법0

boj15650_0.cpp

#include <iostream>
using namespace std;

int n=0, k=0;
int arr[100];

void recur(int depth){
  if(depth == n){
    for(int j=0; j<n; j++){
      cout << arr[j] <<' ';
    }
    cout<<"\n";
    return;
  }
  for(int i=1; i<=k; i++){
    if(depth >0 && arr[depth-1] >= i) continue;
    arr[depth] = i;
    recur(depth+1);
  }
}

int main (void){
  cin.tie(NULL);
  ios::sync_with_stdio("false");
  cin>> k>> n;
  recur(0);
}