1 amd 1

[[emailprotected] shell-test]# chmod a+x para.sh [[emailprotected] shell-test]# lltotal 44-rw-r--r--1 root R Oot 0 Jul 00:52 012-rw-r--r--1 root root 201 Jul 19:04 2-rw-r--r--1 root root 0 Jul 00:45 abc-rwxr-xr-x 1 root root 149 Jul 03:24 echotest1.sh-rwxr-xr-x 1 root root 1

Input 1: Output 0; input 0: Output 1 I had an interview that day. I encountered such a problem: input 0, output 1, and input 1, and output 0. At that time, I came up with the first three methods. I was wondering if there were any other solutions. 1. The most common if-else s

Bandwidth, transmission speed, two bytes, killing people, always confused which is bit, which is byte, the network speed is 10 m, M indicates bit or byte Article Article Record that Mbps is actually a bandwidth unit, not a speed unit. In Mbps, "B" refers to "bit )". The actual speed unit is MB/s, where "B" refers to "Byte (bytes )". Because data is transmitted by byte, not by bit. Because the two big and lowercase "B" and "B" are different, the two units are not only not the same, but also far

Question: enter an integerN, Seek from1ToNThisNIn decimal format1The number of occurrences. For example, enter12, From1To12These integers contain1The numbers are:1,10,11And12,1A total5Times. Analysis: This is a widely used Google interview question. Solving with the most intuitive method is not very difficult, but it is a pity that the efficiency is not very high.AlgorithmIt is not easy to use the analysis capability. Of course, there are only a few simple questions about Google. First,

problem: Ask 1 to the N it N an XOR value between integers, i.e. 1 XOR 2 xor 3 ... xor nRecord f (x, Y) as the XOR value of all integers x through Y.To f (2^k, 2^ (k+1)-1) (note that the ^ in the article represents "power", Xor means "XOR", or "or"):2^k to 2^ (k+1)-

Title: Enter an integer n to find the number of occurrences of 1 in decimal notation from 1 to n integers. For example, enter 12, from 1 to 12 these integers contain 1 of the numbers have 1,10,11, and 12, 11 have appeared 5 times.Method One: Do not consider the time efficiency of the solution, rely on it to get an offe

Title: Enter an integer n to find the number of occurrences of 1 in the decimal representation of 1 to n integers. For example, the input 12, from 1 to 12 of these integers containing 1 of the number has 1,10,11, and 12, 11 appeared in total 5 times. Method One: does not consider the time efficiency the solution, relie

－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－Key Tips:1, the basic data type difference: char, BYTE, short, int, long;float, double;2. What is CTS? The difference between string and string;3, enumeration type;4, self-increase self-reduction;5, how to exchange two variables;6, the value of the assignment expression: Console.WriteLine (a=b+1), the assignment expression also has a value, its value is the va

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 random integer interval with a 1