Generation of Combinatorial Objects · Application: Dynamic Programming (Optional)
Lesson 4
Programming problem.
Write a program that reads an integer \(1 \le n \le 1\ 000\) and outputs the number of ways to tile a \(3 \times n\) board with standard dominoes (size \(1 \times 2\)).
Programming task, Advanced problem
This problem can only be submitted at Cogniterra.
Public samples
Input
4
Example output
11