Tap here to switch tabs
Problem
Submissions

Problem: Domino and Tromino Tiling

Domino and Tromino Tiling asks you to count the distinct ways to fully cover a two-by-n board with two-by-one dominoes and L-shaped trominoes, returning the result modulo a large prime.

Statement

Given an integer n, return the number of distinct ways to completely tile a 2imesn2 imes n board using 2imes12 imes 1 dominoes and L shaped trominoes. Since the answer can be very large, return it modulo 109+710^9 + 7.

Constraints:

  • 1≤1 \leq n ≤1000\leq 1000

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Domino and Tromino Tiling

Domino and Tromino Tiling asks you to count the distinct ways to fully cover a two-by-n board with two-by-one dominoes and L-shaped trominoes, returning the result modulo a large prime.

Statement

Given an integer n, return the number of distinct ways to completely tile a 2imesn2 imes n board using 2imes12 imes 1 dominoes and L shaped trominoes. Since the answer can be very large, return it modulo 109+710^9 + 7.

Constraints:

  • 1≤1 \leq n ≤1000\leq 1000