pat1013. 数素数 (20)

import java.util.*;


public class Main{
public static void main(String [] args){
Scanner input = new Scanner(System.in);
int [] p = new int [10000];
int pm = input.nextInt();
int pn = input.nextInt();
int i = 2,j = 1;
while(j <= pn){
if(isPrimer(i))
p[j++] = i;
i++;
}
int count = 0;
for(i = pm; ; i++){
System.out.print(p[i]);
if(i == pn)
break;
count++;
if(count == 10){
System.out.print("\n");
count = 0;
}
else
System.out.print(" ");
}
}
public static boolean isPrimer(int value){
int half = (int)Math.sqrt(value);
for(int i = 2; i <= half; i++){
if(value % i ==0)
return false;
}
return true;
}
}