double area1 = triple.calcArea(); triple = new mianji(5.3, 6.2, 8); double area2 = triple.calcArea();
System.out.println(\三条边分别为3,4,5的三角形面积是: \ System.out.println(\三条边分别为5.3, 6.2, 8的三角形面积是: \ }
public double calcArea(){ double p = (a b c) / 2;
return Math.sqrt(p * (p - a) * (p- b) * (p - c)); } }
结果截图:
3)程序如下: import java.util.*; public class sushu {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in); System.out.print(\请输入一个整数:\ int x = scan.nextInt();
System.out.print(\请输入一个整数:\ int y = scan.nextInt(); int minNum = Math.min(x, y); int maxNum = Math.max(x, y);
System.out.println(\这两个整数间的素数有:\ for(int i=minNum, count =0; i boolean isPrimeNumber = true; for(int j = 2; j < i; j ) { if(i % j == 0) { isPrimeNumber = false; } } if(count == 3) { System.out.println(); count = 0; } if(isPrimeNumber) { System.out.print(i \ count ; } } } } 结果截图: ? 提高题 1)程序如下: public class bahe { // function:判断temp是否为素数 public boolean checkPrime(int temp){ boolean flag=true; int i=(int)Math.sqrt(temp); for(int j=2;j<=i;j ){ if(temp%j!=0){ continue; }else{ flag=false; j=i 1; } } return flag; } //function:将temp分解为两个素数之和并打印 public void ChangeInt(int temp){ int i=(int)(temp/2); for(int j=2;j<=i;j ){ if(checkPrime(j)){ int k=temp-j; if(checkPrime(k)){ System.out.println(\整数temp\被分解为素数\和素数\之和\ break; } }else{ continue; } } } public static void main(String []args){ bahe ch=new bahe(); for(int i=6;i<=20;i=i 2){ ch.ChangeInt(i); } } } 结果截图: 2)程序如下: import java.util.*; public class Ex1 { public static void gongYue(int m, int n) { if (m > n) { int h = m; m = n; n = h; } if (n % m == 0) {System.out.println(\最大公约数为:\ else { for (int i = n / 2; i > 1; i--) { if (m % i == 0 && n % i == 0) { System.out.println(\最大公约数为:\ break; } } } } public static void gongBei(int m, int n) { if (m > n) { int h = m; m = n; n = h; } for (int j = n; j <= m* n; j ) { if (j % m == 0 && j % n == 0) { System.out.println(\最小公倍数:\ break; } } } public static void main(String[] args) { Scanner scan = new Scanner(System.in); System.out.print(\请输入一个整数:x=\ int x = scan.nextInt(); System.out.print(\请输入一个整数:y=\ int y = scan.nextInt(); gongYue(x, y); gongBei(x, y); } } 结果截图: 实验2.5 ? 基本题