From 367bb858804a297991d6dd8f73565619247374fa Mon Sep 17 00:00:00 2001 From: Ankur Sundara Date: Thu, 3 Nov 2016 13:37:58 -0500 Subject: [PATCH] Update description.md --- library/description.md | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/library/description.md b/library/description.md index 6fb04b2..adb683d 100644 --- a/library/description.md +++ b/library/description.md @@ -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