easyctf/easyctf-2017
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Update description.md

Browse source
This commit is contained in:
Ankur Sundara 2016-11-03 13:37:58 -05:00 committed by GitHub
parent 480673b42a
commit 367bb85880
1 changed files with 3 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
library/description.md
View file

@ -1,7 +1,8 @@
Your library teacher has a 2-row bookshelf that can contain N books in each row. She wants to know the number of ways that she can fill the bookshelf with red-colored books and blue-colored books such that no 2 red-colored books are adjacent to each other (horizontally or vertically).
Input: the integer, N
Output: the number of ways you can place red-colored books and blue-colored books onto the bookshelf
Input: the integer, N (1<=N<=2^128)
Output: the number of ways you can place red-colored books and blue-colored books onto the bookshelf. Since this number might be really big, output it mod 10^9+7.
Ex: N=3