No self-introduction
Loading
Profile
Follow
codes (3)
Java fractal tree
no vote
Drawing fractal tree: first draw the root line segment vertically, and then draw another two line segments with fixed clips at one third and one third of the degree of the line segment respectively. The degree of the line segment is 2 / 3 and 1 / 3 of the original line segment respectively. Repeat this, the straight line segment ⻓ degree ⼩ is at a higher value. Among them, the line color and degree can be fine tuned.
1621101426 0 0
1
Branch and bound method of task assignment
no vote
To define the number of students and activitietask [i]: a value of 0 indicates that activity I is not assigned, and a value of J indicates that activity I is assigned to student J; worker [k]: a value of 0 indicates that student has not assigned activity, and a value of 1 indicates that student has activity
1621101426 0 0
1
16 coins on the back of the problem
4.0
& nbsp; & nbsp; will 9 Coins put in a 3 * 3 matrix, the Xianheng face up, the other heads under. A legal move is to turn any positive upside down coin along with its adjacent coin (not including the diagonal adjacent to the coin). Task request is to find the least number of moves, making all the coins face down. The above shows that the 9 coin problem is the use of 3 * 3 of the matrix, assuming that in a 4 * 4 of the matrix placed 16 coins.The breadth first traversal operation mainly examines the structure and map on the map of the master. 1.2 topic requestVersion 1: reference to the model of 9 coins, the model of 16 coins, and other structure models are established.Version 2: refer to the solution of 9 Coins and solve the problem of 16 coins.Version 3: modify coin flipping rules, such as the rule to the diagonal of the neighbor is flipped, or any custom flip rules. To solve the above problems.
1621101426 1 0
1
No more~
Follows0
Fans0