The question that the master may not be able to solve, who dares to come!! Use C to arrange the numb

Use the algorithm of the standard library, concise and efficient:

#include

#include

#include

using namespace std;

void main()

vectora;

for (int i=0;i<4;++i){;

do{for (unsigned int i=0;i#include

#include

void permutation(vector& a, unsigned int m, unsigned int n)

if (ma;

for (int i=0;i<4;++i){;

permutation(a, 0,

Hehe, I see you're engaged in curriculum design, huh.

I'm sorry, I really don't understand!

I'm taking the test, this question is too simple, right?

If you've learned how to permutate, you'll be able to solve this problem.

Write it this way. s=1

if n=1 then

s=1else

for i=1 to n

s=s*inext i

I think this is the way to write endif, but there are other ways to write it.

I have **, I can input a total of several numbers, and output a permutation of several numbers.

For example, 4 3 then take 3 out of 4 and arrange them.

#include

using namespace std;

bool increase(int* a,int num,int max);

bool isequal(int* a,int num);

void print(int*a,int num);

int main()

int max;

int num;

int* a;

cout<<"Enter the maximum number"<>max;

cout<<"Enter the number you want to arrange"<>num;

if(num>=max)

cout<<"Typing error"a=new int[num];

for(int i=0;iwhile(true)

if(!isequal(a,num))

print(a,num);

increase(a,num,max);

if(a[0]==max)

break;

delete a;

return 0;

bool increase(int* a,int num,int max)

int index=num-1;

while(true)

a[index]++

if(a[index]==max)

if(index==0)

return false;

a[index]=0;

index--;

elsereturn true;

bool isequal(int* a,int num)for(int i=0;ireturn true;

return false;

void print(int*a,int num)for(int i=0;icout<

It's done with a recursive function.

The score is not high enough, leave it to the masters.

A total of 10 starvation chains below c = 120 species above.

There are 8 kinds of three numbers next to each other.

Two numbers are adjacent to each other, and there are only one side of the two numbers, and there are 2 7 = 14 kinds of two counts.

There are 7 6 = 42 kinds of two numbers that are adjacent to each other, and there are two numbers left and right.

There are 120-8-14-42 = 56 species that are not adjacent.

In order to welcome the 2010 Guangzhou Asian Games, a building installed 5 lanterns, the order of their shining is not fixed, each lantern can only be red, orange, yellow, green, blue in one color, and the color of the 5 lanterns is different.

Remember that these 5 lights are flashing in an orderly manner, and in each flash, there is only one light flashing per second, and the time interval between the two adjacent flashes is 5 wonders. If you want to achieve all the different flashes, then the time it will take is at least.

a, 1205 seconds seconds.

How many different ways are there to dye the 6 faces of a cube with 5 colors, (the colors are allowed to run out), and the two adjacent faces (with common edges) to dye different colors? 、

There are 10 types of eggplant.

There are 2 kinds of bending halls for each buried hidden selection method.

There are 20 types in total.

1 2

Suppose, the flower bed is the shape above. That is, 1 and 4 are not adjacent, and 2 and 3 are not adjacent.

Let's start with 1.

I'm in Zone 1, and I can put any suit, which is 4 cases, and the face is divided into two situations:

The first way: Zone 4 is the same as Zone 1, then 2 and 3 have 3 options, and the expression is 4*1*3*3

Second: Zone 4 is different from Zone 1, then Zone 4 has 3 options, while Zone 2 and Zone 3 each have only 2 options, and the expression is 4*3*2*2

Therefore, if we consider that 1, 2, 3, and 4 areas are all the same, there are 4*1*3*3+4*3*2*2=36+48=84 types.

Think of it this way, the first can be selected among the four flowers, after the first one is selected, the second one can be selected among the flowers except the first one, the third one can be selected among the flowers except the second one, and the fourth one can be selected among the flowers except one and three.

One and three flowers are the same: 4*3*3=36

One and three flowers are different: 4*3*2*2=12*4=48