3.6算法训练打卡

门牌号

菜狗做题就是这样,全部遍历一遍然后逐个取余数,并且输出结果

import java.util.Scanner;
// 1:无需package
// 2: 类名必须Main, 不可修改

public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        //在此输入您的代码...int count = 0;
    int count = 0;
    for(int i =1;i<=2020;i++){
      int num = i;
      while(num != 0){
        if(num%10 == 2){
          count++;
        }
        num /=10;
      }
    }
    System.out.println(count);
        scan.close();
    }
}

货物摆放

虽然不难的但是我的三个for循环走一遍然后输出结果超时了

然后去看了@小怂__分解质因数然后判断输出结果

package 蓝桥冲刺31天A.第三天;
 
import java.io.*;
 
/**
 * @ClassName 货物摆放
 * @Description TODO
 * @Author 小怂很怂
 * @Date 2023/3/5 21:36
 * @Version 1.0
 **/
public class 货物摆放 {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static StreamTokenizer st = new StreamTokenizer(br);
    static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
 
    public static void main(String[] args) throws Exception {
        long s=2021041820210418L;
        int a= (int) Math.sqrt(s);
        long []arr=new long[1000000];
        int count =0;
        for (int i=1;i<=a;i++){
            if (s%i==0) {
                arr[count] = i;
                arr[count + 1] = s / i;
                count+=2;
            }
        }
        int sum=0;
        for (int i=0;i<count;i++){
            for (int j=0;j<count;j++){
                for (int k=0;k<count;k++){
                    if (arr[i]*arr[j]*arr[k]==s) sum++;
                }
            }
        }
        pw.println(sum);
        pw.flush();//必须加
    }
 
    public static int nextInt() throws Exception {//int型
        st.nextToken();
        return (int) st.nval;
    }
 
    public static long nextLong() throws Exception {//long型
        st.nextToken();
        return (long) st.nval;
    }
}