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 | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
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.