package basic.day06;public class Test { /**
* @param args
*/
public static void main(String[] args) {
for(int i = 1 ; i < 100 ; i++){
if(i % 2 != 0 ){
System.out.println(i + ",");
}
}
}}
* @param args
*/
public static void main(String[] args) {
for(int i = 1 ; i < 100 ; i++){
if(i % 2 != 0 ){
System.out.println(i + ",");
}
}
}}
* main
*/
public static void main(String[] args) {
ZhiShu zhiShu = new ZhiShu(100,5);
}
//求小于n以下的质数,每行打印k个数字
public ZhiShu(int n,int k){
if (n<=1) {
System.out.println("n必须大于等于2!!");
System.exit(0);
}
for(int i = 2 ; i < n ; i++){
if(i % 2 != 0 ){
k++;
System.out.print(i + "\t");
if (k%5==0) {
System.out.println();
}
}
}
}}
ZhiShu ZhiShu=new ZhiShu();
}
public ZhiShu()
{
int k=0;
System.out.print("1");
for(int i=1;i<=100;i++)
{
k=0;
for(int j=2;j<=i;j++)
{
if(i%j==0)
{
k++;
}
}
if(k==1)
{
System.out.print(","+i);
}
}
}
希望给分!
public static void main(String args[]){
int n=0;
for (int i =0; i <100; ++i) {
if (i%2!=0) {
System.out.print(i+",");
n++;
}
if (n%10==0) {
System.out.print("\n");
}
}
}
}
int k=0;//定个变量
System.out.print("1");//1肯定是 质数!!!
for(int i=1;i<=100;i++)//1-100个数遍历
{
k=0; //每次比较前,将K归0.
for(int j=1;j<=i;j++)//用这个数除以比自己小的数,遍历/J<I,没让J等于自己本身,为下面判断做了保证.
{
if(i%j==0)//能整除 K就+1;
{
k++;
}
}
if(k==1)
{
System.out.print(","+i);//因为质数是只有1或 自己才能被除这一特性,如果只被整除了 1次,也就是这个数除了 1的那次,那就输出出来. }
}
}希望给分,我要分.!
因为 可以被1 和自己本身整除
int k = 0;// 判断被整除的次数
/* 每个数都能整除1和本身 */
for (int j = 2; j < i; j++) if (i % j == 0) k++;
/* k为0表示没有能整除的数,即为质数 */
if (k == 0) System.out.print(" " + i);
}很简洁啊
public class Test {
public static void main(String[] args) {
fun(100);
} public static void fun(int n) {
for (int i = 2,count = 0; i < n; i++) {
boolean flag = true;
for (int j = 2; j <= Math.sqrt(i); j++) {
if (i % j == 0){flag = false;break;}
}
if(flag == true){System.out.print(i + " ");count++;}
if(count % 5 == 0 && flag == true){System.out.println();}
}
}
}
public static void main(String args[])
{
int count = 0;
for (int i = 2; i <= 100; i++)
{
for (int j = 1; j <= Math.sqrt(i); j++)
{
if (i % j == 0)
{
count++;
}
}
if (count == 1)
{
System.out.print(i + ",");
}
count = 0;
}
}
List<Integer> all = new LinkedList<Integer>();
for (int i = 2; i <= max; i++) {
all.add(i);
}
for (int i = 0; i < all.size(); i++) {
int prime = all.get(i);
for (int x = prime << 1; x <= max; x+= prime) {
all.remove((Integer) x); // 必须转型,以免被认作remove(int index)
}
}
System.out.println(all);
public static void main(String[] args) {
fun(100);
} public static void fun(int n) {
for (int i = 2,count = 0; i < n; i++) {
boolean flag = true;
for (int j = 2; j <= Math.sqrt(i); j++) {
if (i % j == 0){flag = false;break;}
}
if(flag == true){System.out.print(i + " ");count++;}
if(count % 5 == 0 && flag == true){System.out.println();}
}
}
}
public static void main(String[] args) {
int[] n = new int[100];
for(int i = 0;i<100;i++){
n[i]=0;
}
//long time1 = System.currentTimeMillis();
for(int i = 2;i<100;i++){
if(n[i]==0){
System.out.print(i+",");
for(int j = i*i;j<100;j+=i){
n[j]=1;
}
}
}
}}测试过的,大家可以试一试。