Aritra741's blog

By Aritra741, history, 6 days ago, In English,

The problem goes like this: You have a book with n ( n<=10^7 ) pages. You can flip exactly X pages to the right and exactly Y pages to the left. If you're initially on page 1, what is the minimum number of moves to go from page 1 to page A? (**100 test cases**)

You can find the problem Here( UVA 11312- Flipping Frustration ).

I will be very thankful if you provide me with a solution.

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

»
6 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Aritra741 (previous revision, new revision, compare).

»
6 days ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

BFS? Just treat it like an usual shortest path problem.

  • »
    »
    6 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I tried BFS. But since it has 100 test cases, I got TLE.

»
6 days ago, # |
  Vote: I like it +5 Vote: I do not like it

Use GCD!

»
6 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Aritra741 (previous revision, new revision, compare).

»
5 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Aritra741 (previous revision, new revision, compare).