Topcoder SRM554 Hard : TheBrickTower（矩阵快速幂）

原创

于 2017-11-16 18:03:14 发布 · 391 阅读

CC 4.0 BY-SA版权

本文介绍了一道关于用不同颜色砖块建造美观塔楼的问题，美观塔楼要求相邻砖块颜色相同的对数不超过K且高度在1到H之间。给定颜色种类C、限制K和高度H，求美观塔楼的数量（模1,234,567,891）。解决方案利用矩阵快速幂进行状态转移计算。" 112190718,10537358,Win10安装WSL Kali Linux教程：轻松拥有Linux子系统,"['Linux', 'Windows 10', 'Kali Linux', 'WSL', 'Windows Terminal']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

John and Brus are building towers using toy bricks. They have an unlimited supply of bricks of C different colors. Each brick is a 1x1x1 cube. A tower of height X is a 2x2xX rectangular prism, built using 4X bricks.
John and Brus want their towers to look nice. A tower is nice if it has the following two properties:
$\,\,\,\,$ 1.There are at most K pairs of neighboring bricks with the same color. (Two bricks are neighboring if they share a common side.)