5(1) public class Main { public static void main(String args[]){ char startLetter='а',endLetter='я'; int startPosition=startLetter,endPosition=endLetter; for(int i=startPosition;i<endPosition;i++){ char russiannumber=(char)i; System.out.println(" "+russiannumber); if((i-startPosition+1)%10==0){ System.out.println(""); } } } } 5(2) public class Main { public static void main(String[] args) { int i, j, s; s = 0; for (i = 1; i <= 20; i++) { s = s + i * i; } System.out.println(s); } } 5(3) public class Main { public static void main(String[] args) { int sum=0,i,j; for (i=1;i<=10;i++){ if (i%2==0){ continue; } sum=sum+i; } System.out.println("sum"+sum); for (j=2;j<=100;j++) { for (i = 2; i <= j /2;i++){ if (j%i==0) break; } if (i > j / 2) { System.out.println("" + j + "是素数"); } } } } 5(4) public class Main { public static void main(String[] args) { double sum=0,item=1; int i = 1,n=20; while (i<=n){ sum=sum+item; i=i+1; item=item*(1.0/i); } System.out.println("sum="+sum); } } public class Main { public static void main(String args[]) { int i,j; float s=0; for(i=1;i<=20;i++) { float t=1; for(j=1;j<=i;j++) { t=t*j; } s+=(float)(1/t); } System.out.println(s); } } 5(5) public class Main { public static void main(String args[]) { int i,j,sum; for(i=1;i<=1000;i++){ for(j=1,sum=0;j<=i/2;j++) { if(i%j==0){ sum=sum+j; } } if(sum==i){ System.out.println(i); } } } } 5(6) import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int M = in.nextInt(); int N = in.nextInt(); int num = M % N; if (M <= 0 || N <= 0) { System.out.println("输入有误!请重新输入。"); return; } if (num == 0) { System.out.println("两数的最大公约数为:"+N); } while (num != 0) { int m = N; int n = num; num = m % n; if (num == 0) { System.out.println("两数的最大公约数为:"+n); System.out.println("两数的最小公倍数是:"+(M *N)/n); } } } } 5(7) public class Main { public static void main(String[] args) { int result = 9999; int n = 1; do { int factorialResult = 1; for(int i = n ; i > 0;i--) { factorialResult = Math.multiplyExact(factorialResult, i); } result -= factorialResult; n++; }while(result >= 0); System.out.println("结果:" + (n - 2)); } }
03-24
912