剛收到一個沒來電號碼的來電,內容大致如下:
你好,九倉電訊為你提供來電號碼服務,以後所有來電都會有號碼顯示,每個月都只係幾十蚊......
(還未講完,電話掛斷)
那是什麼跟什麼呀,打來時又沒有來電號碼,說提供來電號碼服務
那即是有個山賊走過來打劫完之後說為你提供防止山賊服務,以後所有山賊都不會再打劫你......
剛收到一個沒來電號碼的來電,內容大致如下:
你好,九倉電訊為你提供來電號碼服務,以後所有來電都會有號碼顯示,每個月都只係幾十蚊......
(還未講完,電話掛斷)
那是什麼跟什麼呀,打來時又沒有來電號碼,說提供來電號碼服務
那即是有個山賊走過來打劫完之後說為你提供防止山賊服務,以後所有山賊都不會再打劫你......
let's label the coins into letters: ABCDEFGHIJKL
this will yeilds only 24 results, which each one indicates which coin is counterfeit and whether the counterfeit is heavier or lighter. for each weight there are three possible outcome: left side lighter than right side, left side heavier than right side, and even. therefore, there should be 3 to the power 3 combinations. however, three of them will not happen (for ex. three even because every coin is weight at least once and one of them is counterfeit). the results are list as below:
| Weight #1 | Weight #2 | Weight #3 | Result |
| L = R | L = R | L = R | * cannot happen * |
| L = R | L = R | L < R | L is heavier |
| L = R | L = R | L > R | L is lighter |
| L = R | L < R | L = R | K is heavier |
| L = R | L < R | L < R | I is lighter |
| L = R | L < R | L > R | J is lighter |
| L = R | L > R | L = R | K is lighter |
| L = R | L > R | L < R | J is heavier |
| L = R | L > R | L > R | I is heavier |
| L < R | L = R | L = R | G is heavier |
| L < R | L = R | L < R | H is heavier |
| L < R | L = R | L > R | B is lighter |
| L < R | L < R | L = R | F is heavier |
| L < R | L < R | L < R | A is lighter |
| L < R | L < R | L > R | * cannot happen * |
| L < R | L > R | L = R | D is lighter |
| L < R | L > R | L < R | C is lighter |
| L < R | L > R | L > R | E is heavier |
| L > R | L = R | L = R | G is lighter |
| L > R | L = R | L < R | B is heavier |
| L > R | L = R | L > R | H is lighter |
| L > R | L < R | L = R | D is heavier |
| L > R | L < R | L < R | E is lighter |
| L > R | L < R | L > R | C is heavier |
| L > R | L > R | L = R | F is lighter |
| L > R | L > R | L < R | * cannot happen * |
| L > R | L > R | L > R | A is heavier |