3 main () {long a = 10000, b, c = 2800, d, e, f [2801], g; for (; bc;) f [b ] = a / 5; for (; D = 0, g) = C * 2; C- = 14, Printf ("%. 4D", E D / A), E = D% a) for (b = C; D = f [b] * a, f [b] = D% - g, d / = g -, - b; d * = b);
4. Search engine logs To record all inquiry strings, have 10 million queries, no repetition is not more than 3 million
To count the most popular 10 query strings. Memory <1G. Character string length 0-255
(1) Mainly solving the idea // The specific words and the original question are not large.
(2) Analysis of algorithms and complexity
4. Dictionary, design an English spell correction algorithm (1) Thought (2) Algorithm and complexity (3) improvement
5. {AAA, BB, CCC, DD}, {bbb, ff}, {gg}, etc. collection of strings
Requires a collection of intersections that is not empty, as will be {AAA, BB, CCC, DD, FF}, {GG}
(1) Thoughts (2) Algorithm and Complexity (3) Improvement
6 Compare the two integers of comparison statements without IF
7 How to modify the const variable
