excel in 1 30, choose 6 different numbers to combine, how to list all combinations

sub List all 6 out of 30 combinations ().

falseww = 2

for m1 = 1 to 25

for m2 = m1 + 1 to 26for m3 = m2 + 1 to 27for m4 = m3 + 1 to 28for m5 = m4 + 1 to 29for m6 = m5 + 1 to 30cells(ww, 1).value = m1cells(ww, 2).value = m2cells(ww, 3).

value = m3cells(ww, 4).value = m4cells(ww, 5).value = m5cells(ww, 6).

value = m6ww = ww + 1

nextnext

nextnext

nextnext

trueend sub

Don't forget to give points!

There are 64 combinations (4*4*4), and the results are as follows:

There are 10 kinds of summation results, and the number of times of each type is as follows:

Excel used:

Procedure for generating the checklist:

There are a lot of results, and this has to be listed with **.

The order in which they are sorted is not.

There are a total of c(33,6)=33*32*31*30*29*28 6*5*4*3*2*1=1107568 species, and if the sorting order version is distinguished, there are p(33,6)=33*32*31*30*29*28=797448960 species.

It's a combination problem.

6 out of 36 = 36!/6!/(36-6)!1947792 pcs.

With nearly 1.95 million combinations, it is very tedious and error-prone to manual arrangement.

Therefore, it is advisable to programmatically complete grouping.

Wrote a paragraph of fortran**. Due to space limitations, only a small part can be output as examples.

S20, S33, S05, etc. are the numbers that indicate the combined unit, and there are 36 in total. You can automatically replace the numbers with the numbers you choose by adding them to an array and using the numbers in that array.

Attached: Output effect and **.

The almighty VBA can be achieved.

Step 1: Initialize an array with 12 numbers.

Step 2: Suppose you define a jgarr(1 to 220,1 to 3)as integer

js=0for i=1 to 10

for j=i+1 to 11

for k=j+1 to 12

js=js+1

jgarr(js,1)=arr(i):jgarr(js,2)=arr(j):jgarr(js,3)=arr(k)

next k

next j

next i

If you don't understand, ask me again.

Procedure: Result:

A total of 220 groups, pasted and can't be sent, only you can execute it yourself (press alt+f11).

Formulas are achievable. If you have time in the evening, ponder it again.

This write** can be achieved!

This arrangement is not easy to arrange directly in Excel, and it is difficult to finish it with macros.

There is a total of 10 in the full arrangement of 10 numbers=3,628,800, the combination is only c(10,10)=1.

If you want to combine all (i.e., from 1 to 10 digits), you have 2 10-1 = 1023 results.

Since there is no order in the combination, it is possible to artificially give 1 order, for example, the 5th combination is required, we first number 10 numbers, the numbers are 1 a, and the result is a combination of 2 digits, which is 13 according to the arrangement; Similarly, the 6th combination is 123 ,..The 1023rd combination is 123456789a. The calculation is as follows:

First, convert the ordinal number to a binary value, the binary value of 5 is 101, from the highest digit, if the bit value is 1, use the ordinal number of the bit as the number instead of the place value; Drop with a bit value of 0. The first and third digits of 101 are 1, and the rest are 0, and the combination of numbers obtained by replacing the digit sequence number is 13; Similarly, the binary value of 6 is 110, and the result of substitution is 12; The binary value of 1023 is 1111111111, and the substitution result is 123456789a.

It is relatively simple to use macro processing, first make a custom function z(n,x), calculate the binary value of the nth combination, return its xth bit, and then use the loop process to calculate the value of f=z(n,x)*x when x=1 10, and merge the non-0 f-value.

Full and selective arranges can be achieved with circular statements, but they don't seem to make much sense.

There is no end to a column or a row. There may be no way!