Output 1 to 4 of these four digits can be composed of different and no duplicate number of three digits

See the full set of "C language problem sets"

Question: There are 1, 2, 3, 4 digits, can be composed of a number of different and no duplicate number of three digits? How much are they?

1. Procedure analysis: Can fill in the hundred, 10 digits, single-digit digits are 1, 2, 3, 4. Make up all the permutations and then remove the arrangement that does not satisfy the condition.

2. Program Source code:

#include "stdio.h"
#include "conio.h"
Main ()
{
  int i,j,k;
  printf ("\ n");
  for (i=1;i<5;i++)/* The following triple cycle * *
    for (j=1;j<5;j++)
      for (k=1;k<5;k++)
      {
        if (i!=k&&i!=j&&j!=k)/* Ensure that I, j, K three bits are different * *
        printf ("%d,%d,%d\n", i,j,k);
      }
  Getch ();
}

3.Visual C + + 6.0 debugging pass, as shown in figure: