×

# Bits concept , How to Crack

 0 Problem link : http://www.codechef.com/CDSU2015/problems/MHTPAIR Everyone solving this problem with bits concept , I know lots of things about bits but didn't applied it in any problem. So How to apply it in this problem Can anybody explain?? asked 12 Feb '15, 17:18 5★n1n1_4 84●4●6●22 accept rate: 50% Plz anyone help?? (12 Feb '15, 17:46) n1n1_45★ ?????????????? (12 Feb '15, 19:20) n1n1_45★

 2 Most of the people have solved this question using Binary Indexed Tree. You can read more about it from here: Link An alternate approach to solving this question would be the divide and conquer strategy ( like the merge sort ) which I had used. You can check out my solution if you wish to from here Link answered 12 Feb '15, 20:06 5★nellex 23●3 accept rate: 0% Great link, thanks, cleared my doubt. +1 (12 Feb '15, 20:35) thanks @nellex (12 Feb '15, 21:07) n1n1_45★
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×316
×77

question asked: 12 Feb '15, 17:18

question was seen: 1,717 times

last updated: 12 Feb '15, 21:07