数列的和 [递归求解]

import java.util.Scanner;


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

        Scanner scanner = new Scanner(System.in);

        while (scanner.hasNextInt()) {

            int n = scanner.nextInt();

            int m = scanner.nextInt();

            double sum = getSqrt(m, n);

            //输出 -- 保留两位小数
            System.out.printf("%.2fn", sum);

        }
    }

    
    private static double getSqrt(int m, double n) {
        if (m == 0) return 0;
        return n + getSqrt(m - 1, Math.sqrt(n));
    }
}