IWGBS - 0110SS
Dor is IWGolymp student so he has to count in how many ways he can make N digit numbers that is formed by ones and zeroes. But zeroes can not be next to each other. Help to him in how many different numbers can he make.
For example, N = 3: 101, 010, 111, 110, 011
Note: A leading zero is allowed.
Input
A positive integer N (1 ≤ N ≤ 10000).
Output
Answer for the problem.
Example
Input: 2 Output: 3
hide comments
|
horro:
2020-07-23 18:23:02
Use basic memoization dp (replace INT by BIGINT ) ( bigint implementation:: <snip> ) . EASY AC :) Last edit: 2023-01-23 09:17:03 |
|
tarun_28:
2019-11-26 15:12:22
JAVA BigInteger + Pattern = AC ;) |
|
scolar_fuad:
2019-07-13 19:57:42
Due to biginteger fuck use python first i got wa using biginteger |
|
exesharkx:
2019-04-17 00:09:56
C++ Boost Library + Bottom up |
|
ameyanator:
2018-03-24 21:48:46
easy dp problem but my mind whirled around when i saw the answer for n=10000 :P |
|
dunjen_master:
2018-01-04 20:07:19
python rocks!! |
|
Rakend Chauhan:
2017-07-08 13:50:31
big integer really not likes me :( |
|
cms118:
2017-06-13 15:19:25
BigInteger Rocks!!
|
|
kshubham02:
2017-03-28 08:16:23
5 lines in Python.
|
|
mukul arora:
2017-02-25 21:45:54
Python would be good. |
| Added by: | Azat Taryhchiyev |
| Date: | 2012-02-16 |
| Time limit: | 0.100s-3.085s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
RSS