We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Drawing Book
  5. Discussions

Drawing Book

  • Nafeh
     + 0 comments

    The problem sounds tough at first but if you think about it, it's a simple division problem. Here's an easy C# solution -

    	public static int pageCount(int n, int p)
    {
        // When iterating from 1 take the celing value
        double pageTurnNeededFromStart = Math.Ceiling((double)(p-1)/2);
        
        // when iterating from end - take the ceiling value if the end page is even, otherwise take floor value
        double pageTurnNeededFromEnd = n%2==0? Math.Ceiling((double)(n-p)/2) : Math.Floor((double)(n-p)/2);
        
        return (int)Math.Min(pageTurnNeededFromStart, pageTurnNeededFromEnd);
    }