From 3371d7bc1b004d3d6f7d43db5febbba0a259b265 Mon Sep 17 00:00:00 2001 From: Ankur Sundara Date: Thu, 3 Nov 2016 14:46:43 -0500 Subject: [PATCH] Update description.md --- library/description.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/library/description.md b/library/description.md index fd8af11..f339e99 100644 --- a/library/description.md +++ b/library/description.md @@ -1,6 +1,6 @@ Your librarian 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 (1<=N<=2^128) +Input: the integer, N (1<=N<=2^1024) 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.