Skip to content

Commit e36da63

Browse files
committed
remove extra bracket
1 parent 5b074dd commit e36da63

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

data/1511-revision-practical/billys_books.mdx

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ difficulty: Medium
77

88
For this exercise, you’ll be working with the following scenario.
99

10-
Everyday Billy places a book on his floor, with each book being stacked on top of the previous book. On every third day, in addition to stacking a book to the top, Billy also places another book on top of his bookstack (after placing the new book). If there are an odd number of books, then Billy will move the book in the middle of his bookstack to the top. If there an even number of books, then Billy will take the book at the bottom of his bookstack, and move that to the top. He continues this for all N books.
10+
Everyday Billy places a book on his floor, with each book being stacked on top of the previous book. On every third day, in addition to stacking a book to the top, Billy also places another book on top of his bookstack (after placing the new book). If there are an odd number of books, then Billy will move the book in the middle of his bookstack to the top. If there an even number of books, then Billy will take the book at the bottom of his bookstack, and move that to the top. He continues this for all `n` books.
1111

1212
Write a program `billys_books.c` which scans two lines of input:
1313

@@ -59,4 +59,4 @@ $ 1511 autotest billys_books
5959

6060
## Solution
6161

62-
You can view the solution code to this problem [here](https://github.com/csesoc/comp1511-revision-t1-2022/blob/master/solutions/billys-books/solution.c)).
62+
You can view the solution code to this problem [here](https://github.com/csesoc/comp1511-revision-t1-2022/blob/master/solutions/billys-books/solution.c).

0 commit comments

Comments
 (0)