VB Programming Questions Very Urgent!!!!!!!!!!!!!

The last sentence is wrong, you have already swapped the values of the original b and c in the second if sentence, which means that the value of a must be greater than the value of c, and at this time, the value of a is not necessarily greater than the value of b, so this is not good.

Judge the size of the place. Huh.

If you look at the number on the right, it should be a sequence of Fibonacci numbers, i.e., the first and second elements in the sequence are both 1, and the values of the other elements are the sum of the first two elements. This problem is to sum the sequence to 144

option base 1

private sub form_click()dim x() as integer

dim i as integer

dim sum as integer

redim x(2)

x(1) =1: x(2) =1 'The first two elements of the Fibonacci sequence.

do while x(ubound(x)) 144 'The cycle is used to obtain each element less than or equal to 144.

redim preserve x(ubound(x) +1)x(ubound(x)) x(ubound(x) -1) +x(ubound(x) -2)

loopsum = 0

for i = 1 to ubound(x)print x(i); space(5);

sum = sum + x(i)

next i

printprint "sum is"; sumend sub

b, b, c The first question, two +=, calculated from right to left, is correct.

Second, the variable cannot be a keyword, the first character cannot be a number, and special characters can only have underscores.

In the third question, the hexadecimal of option C is correct, and the decimal system of option B should not appear 8, so it is wrong.

Let me tell you what the title means:

Throw dice 36,000 times.

Throw 2 at a time and count the sum of the points of the two dice

In the end, you will find that the number of points with a sum of 7 is the most numerous.

The idea is to write a program that throws two dicons.

Write a 6*6 array of dice results, corresponding to the occurrence of two dice, e.g. 1 and 1 for a[0][0].

For example, 4,6 corresponds to a[3][5].

3.The sum of points is calculated in the diagonal direction of the suboblique.

Example 2 3 4 5 6 7

Who said you don't need English to learn C language?!

I just want to think about the solution and write it ...... detail

If you unfortunately make a mistake in solving the problem and provoke the god Ben don't spray =w= First of all, I found that the number of steps is obviously fixed, an n*n matrix we have to take (n-1)*2 steps, and then we divide it into 2 parts through the lower left-upper right diagonal, the numbers on the diagonal obviously don't care about it, because the path you take is (n-1) characters + middle characters + (n-1) characters, and the diagonal is the middle character.

Then we can happily start BFS!

Starting from (1,1) and (n,n), start bfs to their respective small blocks respectively (that is, turn the whole picture into a graph with the upper half of the triangle and the bottom half of the triangle), go to a grid and add the hash value of the corresponding path you have traveled to the elements in the hash table in that grid (here you need to open the corresponding array to store, for example, let the abchash value be k, then you need to discretize hash[1][3][k]++). It is used to record the grid that you have walked through before (the string hash will be =w=), and then it is similar to a half-fold search (the name you take, not a dichotomy), and the hash table that goes to the middle grid on both sides is compared, for example, in the example, the grid d starts from (1,1) and there are 1 kind of abcd and 2 kinds of abed; There is also 1 ABCD and 2 ABED from (n, n); Therefore, the contribution of the grid d is 1*1+2*2=5

That's how it should be. Don't forget to adopt it =w=