zoj2027TravellingFee(最短路变形)

All 6 sides of a cube are to becoated with paint. Each side is is coated uniformly with one color. When a selectionof n different colors of paint is available, how many different cubes can youmake? Note that any two cubes are onlyto be cal

All 6 sides of a cube are to becoated with paint. Each side is is coated uniformly with one color. When a selectionof n different colors of paint is available, how many different cubes can youmake?

Note that any two cubes are onlyto be called "different" if it is not possible to rotate the one intosuch a position that it appears with the same coloring as the other.

Input

Each line of the input filecontains a single integer n(0denoting the number of different colors. Input is terminated by a line wherethe value ofn=0. This line shouldnot be processed.

Output

For each line of input produce oneline of output. This line should contain the number of different cubes that canbe made by using the according number of colors.

SampleInput Outputfor Sample Input

1 2 0

1 10

---

Problem setter: EricSchmidt

Special Thanks: DerekKisman, EPS

题意：求用n中颜色涂立方体的不同种数，能旋转到的算一种

题意：和上一题UVA - 10601 Cubes （组合+置换） 的立方体旋转考虑的分类是一样的，不过这里我们考虑的是涂面的情况

1.不变置换(1)(2)(3)(4)(5)(6), 共1个;

2.沿对面中心轴旋转 90度, 270度 (1)(2345)(6), (1)(5432)(6) 同类共 6个;

3.沿对面中心轴旋转 180度 (1)(24)(35)(6), 同类共 3个;

4.沿对角线轴旋转 120度, 240度 (152)(346), (251)(643) 同类共 8个;

5.沿对边中点轴旋转 180度 (16)(25)(43) 同类共 6个;

<strong>[cpp]</strong> view plaincopy

1. #include <iostream></iostream>

2. #include <cstdio></cstdio>

3. #include <cstring></cstring>

4. #include <cmath></cmath>

5. #include <algorithm></algorithm>

6. typedef long long ll;

7. using namespace std;

8. ll n;

9. ll still() {

10. return n * n * n * n * n * n;

11. }

12. ll point() {

13. return 4 * 2 * n * n;

14. }

15. ll edge() {

16. return 6 * n * n * n;

17. }

18. ll plane() {

19. return 3 * 2 * n * n * n + 3 * n * n * n * n;

20. }

21. ll polya() {

22. ll ans = 0;

23. ans += still();

24. ans += point();

25. ans += edge();

26. ans += plane();

27. return ans / 24;

28. }

29. int main() {

30. while (scanf("%lld", &n) != EOF && n) {

31. printf("%lld\n", polya());

32. }

33. return 0;

34. }