Codeforces will not be available in the period 01:00-05:00 May, 30 (MSK, UTC +3) because of maintenance. ×

unique12's blog

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

»
7 months 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.