number 1 antivirus

Compile a function. When n is an even number, call the function to calculate 1/2 + 1/4 +... + 1/n. When n is an odd number, call the function 1/1 +

Regular expression set for validating numbers Verification Number: ^[0-9]*$ To verify N-bit numbers: ^\d{n}$ Verify that at least n digits: ^\d{n,}$ Verify the number of m-n bits: ^\d{m,n}$ Verify numbers starting with 0 and non 0: ^ (0|[ 1-9][0-9]*) $ Verify that there is a positive real number with

Idea: If we were to fill 0 in front of the number , we would find that the N-bit all 10 binary number is actually N from 0 to 9 of the full array. That is to say, we arrange each digit of the number from 0 to 9, and we get all the 10 binary numbers. 1 /**2 *ch Storing numbers3 *n n

Recently I had the honor to have a small interview question, studied it, and shared it with me, hoping to help everyone's code career.The following is an interview question: calculate the number of 1 in 1-and calculate the number of 1 in

Regular Expression of phone number (mobile phone number, 3-4 area code, 7-8 live video number, 1-4 extension code) (\ D {11}) | ^ (\ d {7, 8}) | (\ d {4} | \ d {3})-(\ d {7, 8 }) | (\ d {4} | \ d {3})-(\ d {7, 8 }) -(\ d {4} | \ d {3} | \ d {2} | \ d {1}) | (\ d {7, 8 }) -(\

Given a function that randomly generates integers 1 through n, a function (M > N) that can randomly generate integers 1 to M is written. Set n = 5, M = 7The key is to have the same probability of generating 1 to 7 of the number. Call N-time given function, generate n 1 to 5,

Find out the number of occurrences of 1 in an integer of 1~13, and calculate the number of occurrences of 1 in an integer of 100~1300? For that, he counted a few times. 1~13 contains 1

Some small algorithms are of the Java version, and a large number of questions on the network are aimed at C ++. Therefore, Java implementation is rare, but they are the basis of the test, The implementation is the same. You can broaden your thinking and be helpful. /*** 1 hop steps* Question: there are N levels in a step. If you can skip 1 level at a time, you

The task is simple:given any positive an integer N, you're supposed to count the total number of 1 's in the decimal form of The integers from 1 to N. For example, given N being, there is five 1 ' in 1, ten, one, and 12.Input Specification:Each input file contains one test c

Recently find an internship, in doing test assignment encountered such a problem, on the way to record:Said, there are 1 to 100 a total of 100 numbers, put into a circle. Starting from 1, every 1, 2, 3, 4 ... The number takes a number, keeps looping, and finally leaves a few

One, the child process has installed the Pre-removal script returned an error number 1 or 2 workaround:sudo gedit/var/lib/dpkg/statusFind package: Remove the description of this section and delete it before the next package:xxx. After the archive, the operation will be OK.Second, the child process has installed the Post-Installation script returned an error number