(15650) N과 M (2)

https://www.acmicpc.net/problem/15650

단계별로 풀어보기

20단계(백트래킹) 2번째

 

 

 

#include <iostream>
#include <vector>
using namespace std;

int main() 
{
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  
  int n, m;
  
  cin >> n >> m;
  
  vector<int> v(m);
  
  auto func= [&](auto self, int depth) -> void {
    if(depth==m){
      for(int elem:v)  cout << elem << " ";
      cout << "\n";
      return;
    }
    
    for(int i=depth==0?1:v[depth-1]+1;i<=n;i++){
      v[depth]= i;
      self(self, depth+1);
    }
  };
  
  func(func, 0);
  
  return 0;
}