public class Solution { public static void main(String[] args) { int[] prime = new int[50]; prime[0] = 2; int i = 0; int j = 3; boolean judgment = false; while(true) { i = 0; while(i < 50 && prime[i] != 0) { if(j % prime[i] == 0) { judgment = false; break; } i++; } for(int k = 0; k < 50; k++) { if(judgment == true && prime[k] == 0) { prime[k] = j; break; } } judgment = true; j++; if(prime[prime.length - 1] != 0) break; } int count = 0; for(int k = 0; k < 50; k++) { System.out.print(prime[k] + " "); count++; if(count == 10) { System.out.println(); count = 0; } } } }