Java实验测试题目

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? 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); BufferedReader br = new BufferedReader(new InputStreamReader(System.in); String s = br.readLine(); Calendar c = Calendar.getInstance(java.util.Locale.CHINA); String sp = s.split(-); c.set(Calendar.YEAR,Integer.parseInt(sp0); c.set(Calendar.MONTH,Integer.parseInt(sp1)-1); c.set(Calendar.DATE,Integer.parseInt(sp2); int wd = c.get(Calendar.DAY_OF_WEEK); String x = ; switch(wd) case 1:x=星期日;break; case 2:x=星期一;break; case 3:x=星期二;break; case 4:x=星期三;break; case 5:x=星期四;break; case 6:x=星期五;break; case 7:x=星期六;break; System.out.println(s+是:+x); 5 数组的简单排序方法（冒泡，选择，插入排序之一）import java.util.Scanner;public class zuida public static void main(String args) Scanner input = new Scanner(System.in); int Max=0; int score = new int5; /自定义数组长度 System.out.println(please input five numbers：); for(int i=0; i score.length; i+) scorei = input.nextInt(); for(int j=0; jscore.length-1; j+) swap(score); /调用数组排序方法 System.out.println(# the result: #); for(int i=0; iscore.length; i+) System.out.print(scorei+t); public static void swap(int arr) /冒泡法排序 for(int i=0; iarri+1) int temp = arri; arri = arri+1; arri+1 = temp; 6 输入系数，求解一元二次方程import java.util.Scanner;public class zuidapublic static void main(String args)Scanner sc = new Scanner(System.in);System.out.println(输入2次方的系数);int a = sc.nextInt();System.out.println(输入1次方的系数);int b = sc.nextInt();System.out.println(输入0次方的系数);int c = sc.nextInt();double x1 = (-b + Math.sqrt(b*b - 4*a*c)/2*a;double x2 = (-b - Math.sqrt(b*b - 4*a*c)/2*a;System.out.println(根分别是 + x1 + , + x2);7 统计一个输入的字符串中的数字（0-9）个数import java.util.Scanner;public class zuida public static void main(String args) int englishCount = 0;/ 英文字母个数 int spaceCount = 0;/ 空格个数 int numCount = 0;/ 数字个数 int otherCount = 0;/ 其他字符个数 Scanner sc = new Scanner(System.in); System.out.println(请您输入一行字符：); String str = sc.nextLine();/ 取得控制台输入的一行字符 char ch = str.toCharArray();/ 把取道的字符串变成一个char数组 for (int i = 0; i ch.length; i+) if (Character.isDigit(chi) / 判断是否为数字 numCount+; System.out.println(数字的个数： + numCount); 8 给定字符串和一个子字符串，统计字符串中子串出现的次数public class zuida public static void main(String args) String string = 6456; String str = 123; int count = 0; while(true) int index = string.indexOf(str); if(index != -1) string = string.substring(index+str.length(), string.length(); count+; else break; System.out.println(count); 9 计算斐波那契数列的前n项和public class zuida public static void main(String args) System.out.println(sum(10); public static long sum(int n) if(n 1) return 0; if(n = 1) return 1; if(n = 2) return 2; long f1 = 1, f2 = 1; long sum = 2; for(int i=3; i=n; i+) f2 = f1 + f2; f1 = f2 - f1; sum += f2; return sum; 10 输入一个数，输出该数字的因子分解结果import java.util.Scanner;public class zuida public st