Generation of Combinatorial Objects · Application: Dynamic Programming (Optional)

Lesson 4

Nikolai Chukhin · Alexander S. Kulikov

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\)).

1 point
Public samples
Public sample 1
Input
4
Expected output
11