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(0

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

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個;

[cpp] view plaincopy

1. #include 

2. #include 

3. #include 

4. #include 

5. #include 

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. }

聲明：本網頁內容旨在傳播知識，若有侵權等問題請及時與本網聯系，我們將在第一時間刪除處理。TEL:177 7030 7066 E-MAIL:11247931@qq.com