almost lost everything there :/

3/index.md

@@ -7,13 +7,11 @@ Suppose we would like to implement a queue system for a commercial website.
 Given that the website offers a list of items, and each item has a limited quantity in stock, implement a queue of customers, such that each customer can buy only a few products among the available items.
 
 - Determine the item name, quantity, and price in stock.
-- Specify a queue of n customers; each customer can buy k products from one
-item (k is different for each customer).
+- Specify a queue of n customers; each customer can buy k products from one item (k is different for each customer).
 - Customers take turns to enter (enqueue) and leave (dequeue) the queue according to the FIFO order to purchase wanted products.
 - If a customer successfully purchases products, display a message and reduce the number of products in stock. Otherwise, display a warning message if the item has been run out.
 
-Implement the above problems in C/C++ using a Queue data structure. Write
-a main function for testing all written functions (init(), display(), enqueue(), dequeue(),...).
+Implement the above problems in C/C++ using a Queue data structure. Write a main function for testing all written functions (init(), display(), enqueue(), dequeue(),...).
 
 ## ex 2
 
@@ -24,7 +22,6 @@ Choose one method to implement a Stack data structure (Array-based or Stack usin
 - A website may contain a url and a title; suppose that we have visited a list of websites.
 - The order of visited websites is stored in a Backward stack according to FILO.
 - If we return to the previous website, we pop the Backward stack and push it into the Forward stack.
-- And otherwise, when we forward to the next website, we retrieve the top
-website from the Forward stack and push it into the Backward stack.
+- And otherwise, when we forward to the next website, we retrieve the top website from the Forward stack and push it into the Backward stack.
 
 Write a main function to test all written functions (init(), display(), push(), pop(),...).