ACM-素数筛选

public class sushu{
public static void main(String[] args){

int i,m=1000;
int count=0;
for(i=1;i<=m;i++){
if(prime(i)){
count++;
System.out.print(i+" ");
if(count%10==0){
System.out.println();
}
}
}
System.out.println();
System.out.println("1-1000之间共有sushu"+count);
}

private static boolean prime(int n)
{
boolean flag=true;
int j;
if(n==1)
flag=false;
else
{
for(j=2;j<=Math.sqrt(n);j++)
{
if(n%j==0)
{
flag=false;
break;
}
else
flag=true;
}
}
return flag;
}

}