C language: there are 1, 2, 3, and 4 numbers. How many three numbers can be composed of different and non-repeated numbers? Print it out?

C language: there are 1, 2, 3, and 4 numbers. How many three numbers can be composed of different and non-repeated numbers? Print it out?
There are 1, 2, 3, and 4 numbers. How many three numbers can be composed of different and non-repeated numbers? Print it out? Solution: Program:

# Include <stdio. h> int main () {int I, j, k; int count = 0; for (I = 1; I <5; I ++) {for (j = 1; j <5; j ++) {for (k = 1; k <5; k ++) {if (I! = J & I! = K & j! = K) {printf ("% d", I, j, k); count ++ ;}}}} printf ("count = % d \ n", count); return 0 ;}

 

Results: 123 124 132 134 142 143 213 214 231 234 241 243 312 314 321 324 341 342 412 413 421 423 431 432 count = 24