The rule is: "1" can be arbitrary number,
If: a shout "four don't know" (meaning that a judgment, the parties dice clock can gather together enough for four or more than four arbitrary number, such as a 143, 445 b can gather together enough four 4, because 1 can be 4, 113, 223 b can gather together enough 4 3, because 1 could be a 3)
B directly called "open" (is open roll clock directly, if you have four or more than four Numbers, b lose, if not, b win)
Programming to solve: b win probability have how old,
2. If there are 1000 * 1000 small grid, each has a small grid number, represents the number of the grid (out-of-order, a number between 0 and 999999, don't repeat), each has four small grid vertex at the same time, also corresponding to the four number (out-of-order, arbitrary Numbers between 0-999999, can be repeated), requirements:
1. Programming to generate the grid (request has its own number, and the corresponding vertex number);
2. The random input a grid number, quickly find and its adjacent grid (adjacent mean, they have at least one vertex number),
CodePudding user response:
These two problems have the answer?CodePudding user response:
Are you looking for teacher?CodePudding user response:
Mentors are you looking for?