Java循环

求数组的和 9 99 999

public class Main {
    public static void main(String[] args) {

        //write your code here........
        long sum=0;
        long a=9;
        for(int i=0;i<=9;i++){
               sum+=a;
               a=a*10+9;
        }
        System.out.println(sum);

    }
}

public class Main {
    public static void main(String[] args) {

        //write your code here........
        String a = "9";
        long sum = 0;
        for(int i = 0;i<10;i++){
            sum = Long.parseLong(a) + sum;
            a = a + "9";
        }
        System.out.println(sum);

    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        int count = 0;
        Scanner scanner = new Scanner(System.in);

        //write your code here......
       while(true){
           if(scanner.nextInt()<=0) break;
           if(!scanner.hasNextInt()) break;
           count++;
       }
        System.out.println(count);
    }
}

求mn两数的最小公倍数

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner console = new Scanner(System.in);
        int m = console.nextInt();
        int n = console.nextInt();
        int result = getCM(m, n);
        System.out.println(result);
    }

    public static int getCM(int m, int n){

        //write your code here......
        int max=Math.max(m,n);
        for(int i = max;i <= m * n ; i++){
            if(i % m == 0 && i % n == 0){
                return i;
            }
        }
        return -1;

    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        float h=scanner.nextFloat();
        int n =scanner.nextInt();
        float dis = 0;
        //write your code here......
        for(int i = 0;i <= n;i++){
            dis +=h;
            h/=2;
           dis+=h*3;
            
        }

       System.out.println(String.format("%.3f", h)+" "+String.format("%.3f", dis-h));
        

    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        //write your code here......
     int sum=0;   
     int count=0;
     int num;
    while(true){
        num=scan.nextInt();
        if(num<0){
            break;
        }else{
            sum+=num;
            count++;
        }        
    }  
        scan.close();
        if(count>0){
            double avg=(double)sum/count;
             System.out.println(String.format("%.2f",avg));
        }
 
        

    }
}

求质数

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Main main = new Main();
        Scanner scan = new Scanner(System.in);
        int number = scan.nextInt();
        System.out.println(main.isPrimeNumber(number));
    }

    public Boolean isPrimeNumber(int number) {

        //write your code here......
        boolean flag =true;
        for(int i=2;i<number;i++){
            if(number%i==0){
                flag= false;
                break;
            }
        }
        return flag;

    }
}

求位数

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int num = scan.nextInt();
        scan.close();
        int cout=1;
        //write code here......
        if(num<=0){
            System.out.print(num);
        }else
        { 
            while((num/10)>0)
            { 
               
                num/=10; cout++;
            
             }
            System.out.println(cout);
        }
      
  
    }
}