在屏幕上打印出n行的金字塔图案,如,若n=5,则图案如下:
*
***
*****
*******
*********
import java.util.Scanner;
public class seven{
public static void main(String[] args) {
Scanner sn = new Scanner(System.in);
int rows = sn.nextInt();
for(int i = 1;i <= rows;i++) {
for(int k = 1;k <= 2*i-1;k++) {
System.out.print("*");
}
System.out.println();
}
}
}
产生100个0-999之间的随机整数,然后判断这100个随机整数哪些是素数,哪些不是?
public class Test {
public static void main(String[] args) {
int[] arr = new int[100];
System.out.print("随机数组为:");
for(int i = 0; i < arr.length; i++) {
arr[i] = (int) (Math.random() * 1000);
System.out.print(arr[i] + ",");
}
System.out.println();
StringBuilder primeBuilder = new StringBuilder();
StringBuilder notPrimeBuilder = new StringBuilder();
for(int i : arr) {
if(isPrime(i)) {
primeBuilder.append(i + ",");
} else {
notPrimeBuilder.append(i + ",");
}
}
System.out.println("素数有:" + primeBuilder.toString());
System.out.println("非素数有:" + notPrimeBuilder.toString());
}
public static boolean isPrime(int n) {
boolean flag = true;
if(n < 2) {
flag = false;
}
for(int i = 2; i < Math.sqrt(n); i++) {
if(n % i == 0) {
flag = false;
}
}
return flag;
}
}