When submitting a solution in C++, please select either C++14 (GCC 6-32) or C++17 (GCC 7-32) as your compiler. ×

unique12's blog

By unique12, history, 4 years ago, In English
  • Vote: I like it
  • +1
  • Vote: I do not like it

| Write comment?
»
4 years ago, # |
  Vote: I like it +1 Vote: I do not like it

You should solve it using Meet in the middle technique since $$$O(2^{n})$$$ won't fit in the time limit.