蓝桥杯算法提高三进制数位和

ゞ浴缸里的玫瑰 2022-06-02 08:46 228阅读 0赞

![这里写图片描述][SouthEast]  
法一：函数解法（原创）

import java.util.Scanner;
    public class Main {
    
        static int time = 0;
    
        public static boolean panduanSan(int result) {
       //判断是否是三进制数
            int index = 0;
            while(result != 0) {
                int flag = result % 10;
                result /= 10;
                if(flag > 2) {
                    return false;
                }
            }
            return true;
        }
    
        public static int QiuHe(int a) {
       //求每位数
            int sum = 0,i = 0;
            while(a != 0) {
                int flag = a % 10;
                a /= 10;
                sum += flag;
                i ++;
            }
            return sum;
        }
    
        public static boolean panduanSu(int a) {
            if(a == 1 || a == 0) {
                return false;
            }
            for(int i = 2; i <= a / 2;i++) {
                if(a % i == 0) {
                    return false;
                }
            }
            return true;
        }
    
        public static void main(String[] args) {
            Scanner sc = new Scanner(System.in);
            String L = sc.next();
            String R = sc.next();
            String str = new String();
            for(int i = 0;i <= 222222;i++) {
                int sum = QiuHe(i);
                if(panduanSan(i) == true) {
                    if(sum >= Integer.valueOf(L) && sum <= Integer.valueOf(R)) {
       //三进制
                        time ++;
                        continue;
                    }
                    if(panduanSu(sum) == true) {
    // System.out.println(i);
                        time ++;
                    }
                }
    
            }
            System.out.println(time);
        }
    }

法二：循环求解  
来自

> [http://blog.csdn.net/mcp3128/article/details/78633675][http_blog.csdn.net_mcp3128_article_details_78633675]

import java.util.Scanner;  
    
        public class Main {   
            public static void main(String[] args) {  
                Scanner s = new Scanner(System.in);  
                int L = s.nextInt();  
                int R = s.nextInt();  
                int sum = 0, k = 0;  
                for (int a = 0; a < 3; a++) {  
                    for (int b = 0; b < 3; b++) {  
                        for (int c = 0; c < 3; c++) {  
                            for (int d = 0; d < 3; d++) {  
                                for (int e = 0; e < 3; e++) {  
                                    for (int f = 0; f < 3; f++) {  
                                        sum = a + b + c + d + e + f;//求和 
                                        if ((sum >= L && sum <= R) || (sum == 2)  
                                                || (sum == 3) || (sum == 5)  
                                                || (sum == 7) || (sum == 11))  
                                            k++;//计数 
                                    }  
                                }  
                            }  
                        }  
                    }  
                }  
                System.out.println(k);  
            }  
        }

[SouthEast]: /images/20220602/4ea21cb14c7c41f18d598cf1b4e40508.png
[http_blog.csdn.net_mcp3128_article_details_78633675]: http://blog.csdn.net/mcp3128/article/details/78633675