15649번 - N과 M (1)

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

15649번: N과 M (1)

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

int N, M, cnt;
int arr[8];
bool visit[8];
vector<int> v;
void dfs(int cnt)
{
  if(cnt == M)
  {
    for(int i=0; i<v.size(); i++)
      cout << v[i] << " ";
    cout << '\n';
    return ;
  }
  for(int i=0; i<N; i++)
  {
    if(visit[i])
      continue;
    visit[i] = true;
    v.push_back(arr[i]);
    dfs(cnt+1);
    v.pop_back();
    visit[i] = false;

  }
}
int main()
{
  cin >> N >> M;
  for(int i=0; i<N; i++)
  {
    arr[i] = i+1;
    visit[i] = false;
  }
  dfs(0);
}