Necklace of Beads这个除了用穷举还有更好的算法么

Problem Description
Beads of red, blue or green colors are connected together into a circular necklace of n beads ( n < 40 ). If the repetitions that are produced by rotation around the center of the circular necklace or reflection to the axis of symmetry are all neglected, how many different forms of the necklace are there?

Input
The input has several lines, and each line contains the input data n.
-1 denotes the end of the input file.

Output
The output should contain the output data: Number of different forms, in each line correspondent to the input data.

Sample Input
4
5
-1

Sample Output
21
39

查看全部
shunfurh
编程介的小学生
2018/11/15 14:33
  • 算法
  • lines
  • each
  • 点赞
  • 收藏
  • 回答
    私信
满意答案
查看全部

1个回复