Given N marices each of dimention A*B, filled only with 0 or 1.
What is the minimum number of cells you need to check so that you can differentiate between the N matrices?
The answer is log_base_2(N). Can someone explain this answer?
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 159 |
5 | atcoder_official | 156 |
6 | djm03178 | 153 |
6 | adamant | 153 |
8 | luogu_official | 149 |
9 | awoo | 148 |
10 | TheScrasse | 146 |
Given N marices each of dimention A*B, filled only with 0 or 1.
What is the minimum number of cells you need to check so that you can differentiate between the N matrices?
The answer is log_base_2(N). Can someone explain this answer?
Name |
---|
I'm not sure I understand the question, but
Suppose AB> N, Suppose N matrices, each having 1 zero and AB-1 ones. You'll need to see all O(N) position where zero is possible to differentiate matricies.
Maybe the problem asks to prove that log(N) is a lower bound.