Lanqiao Cup: How many rounds are there in 1.200000 (the number of rounds) (answer)

topic

[Problem description]
How many divisors are there in 1200000 (only positive divisors are calculated).
[Answer Submission]
This is a question that fills in the blanks with the result, you only need to calculate the result and submit it. The result of this question is an integer. Only fill in this integer when submitting the answer. If you fill in the extra content, you will not be able to score.

answer

  96

Code

public class Main {
    
     //蓝桥杯要求class命名为Main,且无package
    public static void main(String []args){
    
    
        int a = 1200000;
        int count=0;
        for(int i=1;i<=a;i++){
    
    
            if(a%i==0){
    
    
                count++;
            }
        }
        System.out.println(count);
    }
}


Guess you like

Origin blog.csdn.net/qq_47168235/article/details/108905785