正六面体染色正六面体用4种颜色染色。共有多少种不同的染色样式？要考虑六面体可以任意旋转

最新推荐文章于 2023-12-16 14:09:49 发布

转载最新推荐文章于 2023-12-16 14:09:49 发布 · 1.3k 阅读

java 专栏收录该内容

42 篇文章

订阅专栏

本文介绍了一种用于正六面体染色的算法，通过循环嵌套和集合操作，实现了对所有可能组合的高效计算，并通过自定义函数对结果进行筛选和优化。

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

import java.util.ArrayList;  


public class 正六面体染色 {  
    public static int sum = 0;  
    /** 
     * @param args 
     */  
    public static void main(String[] args) {  
        // TODO Auto-generated method stub  
        f();  
    }  
  
    public static void f(){  
        ArrayList<Integer> arr = new ArrayList<Integer>(4*4*4*4*4*4);  
        for(int x1 = 1; x1 <= 4; x1++){  
            for(int x2 = 1; x2 <= 4; x2++){  
                for(int x3 = 1; x3 <= 4; x3++){  
                    for(int x4 = 1; x4 <= 4; x4++){  
                        for(int x5 = 1; x5 <= 4; x5++){  
                            for(int x6 = 1; x6 <= 4; x6++){  
                                arr.add(x1 * 100000 + x2 * 10000 + x3 * 1000 + x4 * 100 + x5 * 10 + x6);  
                            }  
                        }  
                    }  
                }  
            }  
        }  
  
        for(int x1 = 1; x1 <= 4; x1++){  
            for(int x2 = 1; x2 <= 4; x2++){  
                for(int x3 = 1; x3 <= 4; x3++){  
                    for(int x4 = 1; x4 <= 4; x4++){  
                        for(int x5 = 1; x5 <= 4; x5++){  
                            for(int x6 = 1; x6 <= 4; x6++){  
                                if(arr.contains(x1 * 100000 + x2 * 10000 + x3 * 1000 + x4 * 100 + x5 * 10 + x6)){  
                                    sum++;  
                                    arr.remove(new Integer(x1 * 100000 + x2 * 10000 + x3 * 1000 + x4 * 100 + x5 * 10 + x6));  
                                    up(x4,x1,x3,x6,x5,x2,arr);  
                                    left(x5,x2,x1,x4,x6,x3,arr);  
                                    rotate(x1,x5,x2,x3,x4,x6,arr);  
                                }  
                            }  
                        }  
                    }  
                }  
            }  
        }  
        System.out.println(sum);  
    }  
      
    public static void up(int x1, int x2, int x3, int x4, int x5, int x6, ArrayList<Integer> arr){  
        if(arr.remove(new Integer(x1 * 100000 + x2 * 10000 + x3 * 1000 + x4 * 100 + x5 * 10 + x6))){  
                up(x4,x1,x3,x6,x5,x2,arr);  
                left(x5,x2,x1,x4,x6,x3,arr);  
                rotate(x1,x5,x2,x3,x4,x6,arr);  
        }else  
            return;   
    }  
      
    public static void left(int x1, int x2, int x3, int x4, int x5, int x6, ArrayList<Integer> arr){  
        if(arr.remove(new Integer(x1 * 100000 + x2 * 10000 + x3 * 1000 + x4 * 100 + x5 * 10 + x6))){  
                up(x4,x1,x3,x6,x5,x2,arr);  
                left(x5,x2,x1,x4,x6,x3,arr);  
                rotate(x1,x5,x2,x3,x4,x6,arr);  
        }else  
                return;   
    }  
  
    public static void rotate(int x1, int x2, int x3, int x4, int x5, int x6, ArrayList<Integer> arr){  
        if(arr.remove(new Integer(x1 * 100000 + x2 * 10000 + x3 * 1000 + x4 * 100 + x5 * 10 + x6))){  
                up(x4,x1,x3,x6,x5,x2,arr);  
                left(x5,x2,x1,x4,x6,x3,arr);  
                rotate(x1,x5,x2,x3,x4,x6,arr);  
        }else  
                return;   
    }  
}