Help needed in Assembly Line Spoj problem

Revision en2, by code_warrior, 2020-08-13 10:46:20

Can anyone help me figure how to get AC in this problem. I tried to solve it with binary search, made several submissions,but couldn't get AC. My idea is to search from 0 upto 1e18 and check if this number of products is possible or not and thus correspondingly increase or decrease my bounds and keep a track of maximum number of products possible and finally output it. It would be very helpful if someone could share his/her approach.

Problem SPOJ

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English code_warrior 2020-08-16 15:25:39 1 Tiny change: ' products possible ' -> ' products possible '
en2 English code_warrior 2020-08-13 10:46:20 2 Tiny change: 'igure how yo get AC i' -> 'igure how to get AC i'
en1 English code_warrior 2020-08-13 10:45:55 542 Initial revision (published)