number between 1 and 10

int rand7() { return rand()%7+1; } int rand10(){ int x=0; do { x=(rand7()-1)*7+rand7(); } while(x>40); return x%10+1;} Analysis: To ensure the even distribution of rand10 () on integers 1-10, you can construct a

From: http://blog.csdn.net/furturerock/article/details/6850634View Code 1 int rand7() 2 { 3 return rand()%7+1; 4 } 5 6 int rand10() 7 { 8 int x=0; 9 do10 {11 x=(rand7()-1)*7+rand7();12 }13 while(x>40);14

1. Int rand7 ()2 .{3. Return rand () % 7 + 1;4 .}5.6. Int rand10 ()7 .{8. Int x = 0;9. Do10 .{11. x = (rand7 ()-1) * 7 + rand7 ();12 .}13. While (x> 40 );14. Return X % 10 + 1;15 .}Analysis: To ensure the even distribution of rand10 () on integers 1-

[Topic] enter an integer n to calculate the number of occurrences of 1 in the n positive numbers from 1 to n. For example, if the input value is 12 and a number is 1, 10, 11, and 12, there are 5 ones in total, the output value is 5. [Si Lu 1]

There are 1 to 10 W of the 10 W number, remove 2 and disrupt the order, how to find the two numbersDescription: there are 1 to 10 W numbers, remove 2 and disrupt the order, and how to find the two numbers.1. Bitmap method:Assume that the array to be

Micro-credit operation is to select a subscription or service number better? This is the tribe on the internet often see some friends are asking questions, in fact, in the tribal view, if there is good content, whether the subscription number or

This problem is the application of the typical analysis and inductive method. By analyzing each number of each bit to 1 by which factors, so summed up all the number of 1 of the occurrence of the law, very classic. There is no other better way of

Random Number problem-it is known that there is a Random7 () function, returns a random natural number from 1 to 7, so that the Random7 () is used to construct a random 1 ~ Random10 ~ 10. random7random10 Math. random () randomly generates the float

1. Find two numbers that appear only once in the array. 1) Question: Except for two numbers in an integer array, other numbers appear twice. Write a program to find the numbers that appear only once. RequirementsThe time complexity isO (N),The

Often someone communications raid, but it does not know its so dye, today I will be an example of Internet cafes to explain.With the expansion of Internet cafes, internet cafes will increase the number of computers, Internet users also increased,