/*
 * $Id: PermutationMatrix.c,v 1.2 2008/07/08 02:54:40 kanai Exp $
 * gcc -o PermutationMatrix PermutationMatrix.c
 */
#include <sys/types.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>

void dump_str(int *str, int maxlevel)
{
  int i;

  for(i = 0; i < maxlevel; i++)
    {
      printf("[%d]", (int)str[i] );

    }
  printf("\n");
}

void do_func(int *str, int maxlevel, int level, int phase, void func(int *, int) )
{
  int i;
  int tmp;
  int *p;
  int *newstr;

  newstr = malloc(sizeof(int) * maxlevel);

  for(i = 1; i < (level + 1); i++)
    {
      memcpy(newstr, str, sizeof(int) * maxlevel);
      p = newstr;
      tmp = i;
      while(tmp != 0)
	{
	  if(*p == 0)
	    {
	      tmp--;
	    }
	  p++;
	}
      p--;

      *p = level;

      if(level != 1)
	{
	  do_func(newstr, maxlevel, level - 1, phase + 1, func);
	}
      else
	{
	  func(newstr, maxlevel);
	  fflush(stdout);
	}
    }

  free(newstr);
}

int main(int argc, char **argv)
{
  int maxlevel;
  int *str;
  int i;

  maxlevel = (argc == 2) ? atoi(argv[1]) : 4;

  str = malloc(sizeof(int) * (size_t)maxlevel);
  for(i = 0; i < maxlevel; i++)
    {
      str[i] = 0;
    }
  do_func(str, maxlevel, maxlevel, 0, dump_str);

  return(0);
}
