// Finding permutations 
// using stl algorithm next_permutation
//
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>

using namespace std;

void vector_out(vector<int> v)
{
  copy(v.begin(),v.end(), // from
       ostream_iterator<int>(cout," ")); // to 
  cout<<endl;
}

int factorial (const int n){
  int fact = 1;
  if (n <= 1)
    return 1;
  else
    fact  = n * factorial (n - 1); // recursion
  return fact;
}


int main () {
  const int N=5;
  vector<int> state;
  for (int i=0;i<N;++i) state.push_back(i);
  sort (state.begin(),state.end()); 
  int i = 1;
  do {
    cout<<"state # "<<i<<" is  ";
    vector_out(state);
    ++i;
  } while (next_permutation (state.begin(),state.end()));
  cout<<"N! = "<< factorial(N)<<endl;
  return 0;
}