当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

4092:Yummy Triangular Pizza

题目描述
  Pizzahat has released a new pizza with triangular shaped pieces. This pizza is composed of some equal-sized equilateral triangle. Moreover, all the triangles are connected. Also, if two triangles are directly connected, they must share a common edge.
  How many different shapes of this kind of N-pieces pizza are there? Two patterns are considered as same if they can completely overlap after rotation and shifting (note that flipping is not included).
输入解释
  There are multiple test cases. The first line of input contains a single integer denoting the number of test cases.
  For each test case, there is only one line with only one integer N denoting the number of pieces that can be used. (1 <= N <= 16)
输出解释
  For each test case, output a single integer denoting the number of possible different shapes of the pizza.
输入样例
3
2
4
10
输出样例
Case #1: 1
Case #2: 4
Case #3: 866

提示
Case2:

来自杭电HDUOJ的附加信息
Recommend lcy

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-4092

最后修改于 2020-10-25T23:10:08+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)