Java实验测试题目.docxVIP

  • 14
  • 0
  • 约4.92千字
  • 约 19页
  • 2020-03-09 发布于江西
  • 举报
1 输入两个自然数,找出两个数的最大公因数 import java.util.Scanner; public class zuida { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); System.out.print(请输入第一个数字 ); int num1 = scanner.nextInt(); System.out.print(请输入第2个数字 ); int num2 = scanner.nextInt(); int temp = num1; num1 = num1 num2? num1: num2; num2 = temp num2? temp: num2; for(int num = num1; num = 1; num--){ if(num1 % num == 0 num2 % num == 0){ System.out.println(最大公因数为 : + num); break; } } } } 2 接受输入 x,计算 sinx 的近似值(不使用 Math 类中的函数,自己实现) package Test; import java.util.Scanner; public class sin { static double stop = 0.001; public static void main(String[] args) { sin s = new sin(); System.out.println(The value of sin(30)); System.out.println(s.sin(Math.PI / 6.0, 100)); } double sin(double x, int n) { double v = x; int postive = 1; for (int i = 1; i 2 * n; i = i + 2) { v = v + postive * (Math.pow(x, i) / factorial(i)); postive = postive * -1; } return v; } private double factorial(double s) { double r = 1; for (int i = 1; i = s; i++) { r = r * i; } return r; } } 3 打印所有的水仙花数(一个三位数,各位的三次方之和等于它本身) public class zuida { public static void main(String args[]) { int count=0;//水仙花数个数计数器 for(int num=100;num1000;num++) { int g=num%10;//个位 int s=num/10%10;//十位 int b=num/100;//百位 if(g*g*g+s*s*s+b*b*b==num){ count++; System.out.print(num+ ); if(count%5==4) System.out.println(); } } } } 4 输入年、月、日,判断这一天是星期几(年、月、日的输入有一定范围,数值合理) import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Calendar; public class zuida { public static void main(String[] args) throws IOException { System.out.println(请输入年月日,格式: yyyy-MM-dd); ufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String s = br.readLine(); alendar c = Calendar.getInstance(java.util.Locale. CHINA ); String[] sp = s.split(-); c.set(Calendar.YEAR,Integer.parseInt(sp[0])); c.set(Calendar.MONTH,Integer.parseInt (sp[1])-1); c.set(Calendar.DATE,Integer.parseInt(sp[2])); int wd = c.get(Ca

文档评论(0)

1亿VIP精品文档

相关文档