Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

More of an informatics question, rather than applied mathematics -

Problem Statement Problem Statement

Source - Zonal Informatics Olympiad 2011 Question Paper

Although, I've tried a few brute methods, I haven't really understood the actual logic with which it was meant to be solved.

share|cite|improve this question
up vote 3 down vote accepted

Seems familiar. Check Burrows–Wheeler transform.

share|cite|improve this answer
    
That's it! Thanks a lot mate... – 7Aces Oct 31 '12 at 8:15

I just found a solution for the (a) sequence :

0 0 1 1 0 1 1 1 (first row)

The complete ordered matrix is as follows :

0 0 1 1 0 1 1 1

0 1 1 0 1 1 1 0

0 1 1 1 0 0 1 1

1 0 0 1 1 0 1 1

1 0 1 1 1 0 0 1

1 1 0 0 1 1 0 1

1 1 0 1 1 1 0 0

1 1 1 0 0 1 1 0

During the solutions development i found some useful theorems that help accomplish the solution.

I'll post this as soon as possible.--> No more necessary, the inversion algorithm provided in the wikipedia page provide the necessary solution.

Cheers,

Yassine

share|cite|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.