rt java.util.*;
public class CPrograms2 {
private static int bag[]= new int[5]; //存储最大价值时的存储策略
private static int maxValue = Integer.MIN_VALUE;
public static void main(String[] args) {
//Test1;
//Test2;
//Test3;
//Test4;
}
//因式分解
private static void Test4() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
System.out.print("n=");
for (int i=2;i*i<=n;){
if (n%i == 0){
System.out.print(i + "*");
n /= i;
}else
i++;
}
System.out.print(n);
}
//求最大公约数和最小公倍数
private static void Test3() {
Scanner sc = new Scanner(System.in);
String[] input = sc.nextLine().split(" ");
int m = Integer.valueOf(input[0]);
int n = Integer.valueOf(input[1]);
if (m == n){
System.out.print(m + " " + n);
return;
}
int num1 = Integer.compare(m, n) > 0 ? m : n;
int num2 = Integer.compare(m, n) < 0 ? m : n;
int temp = 0;
while (num2 > 0){
temp = num1%num2;
num1 = num2;
num2 = temp;
}
System.out.print(num1 + " " + m*n/num1);
}
//求0~500之间的10个最大质数(素数)
private static void Test2() {
int[] prime = new int[10];
int index = 0;
int flag = 0;
for (int i=500;i>=1;i--){
flag = 0;
for (int j=2;j*j<=i;j++){ //这里的j*j<=i对程序的优化非常大,如果只是j<=i,时间复杂度为O(n^2),改良后为O(n^(3/2))
if (i%j == 0){
flag = 1;
break;
}
}
if (flag == 0)
prime[index++] = i;
if(index == 10)
break;
}
for (int i=9;i>=0;i--)
System.out.print(prime[i] + " ");
}