Verdict: Time Limit Exceeded Problem: https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4776 My solution: https://paste.ubuntu.com/p/CxnFNF76Fd/ Can anyone help me please?
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 162 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 154 |
8 | pajenegod | 147 |
9 | Um_nik | 145 |
9 | BledDest | 145 |
Verdict: Time Limit Exceeded Problem: https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4776 My solution: https://paste.ubuntu.com/p/CxnFNF76Fd/ Can anyone help me please?
Name |
---|
You should solve it using Meet in the middle technique since $$$O(2^{n})$$$ won't fit in the time limit.