用Java语句求100以内的素数 用JAVA语言编写一程序，求100以内的所有素数
Java\u6c42100\u4ee5\u5185\u7684\u8d28\u6570\u7684\u5c0f\u4ee3\u7801\uff011\u3001\u8bbe\u8ba1\u5b9e\u73b0\uff1a\u901a\u8fc7for\u5faa\u73af\u8f93\u51fa\uff0c\u4f7f\u7528break\u8df3\u51fa\u3002
\uff081\uff09\u9700\u6c42\uff1a\u8f93\u51fa1~100\u7684\u6240\u6709\u7d20\u6570\u3002
\uff082\uff09\u7d20\u6570\uff1a
--\u5224\u65ad\u6761\u4ef61\uff1a\u53ea\u80fd\u88ab1\u548c\u672c\u8eab\u6574\u9664\u7684\u79f0\u4e3a\u7d20\u6570\u3002
--\u5224\u65ad\u6761\u4ef62\uff1a\u5728\u533a\u95f4\uff081\uff0cx/2\uff09\u4e2d\u627e\u4e0d\u5230\u80fd\u6574\u9664\u7d20\u6570x\u7684\u6574\u6570\u3002
--\u5224\u65ad\u6761\u4ef63\uff1a\u5728\u533a\u95f4\uff081\uff0csqrt(x)\uff09\u4e2d\u627e\u4e0d\u5230\u80fd\u6574\u9664\u7d20\u6570x\u7684\u6574\u6570\u3002
\uff083\uff09\u5b8c\u6574\u4ee3\u7801\u5982\u4e0b\uff1a
2\u3001if\uff08b\uff09\u8bed\u53e5\u89e3\u6790\uff1a\u662f\u5426\u662f\u8d28\u6570\u7684\u6807\u5fd7\uff0c\u662f\u5c31\u8f93\u51fa \u3002
b\u7684\u503c\u5199\u5728if (n % i == 0){ b = false; }\u4e2d\u3002\u8fd9\u5c31\u662f\u8d28\u6570\u7684\u5224\u65ad\u53d1\u53d1\uff08\u5373\u5982\u679c\u6709\u80fd\u88ab\u6574\u9664\u7684\uff0c\u5219\u4e0d\u662f\u8d28\u6570 \uff09\uff0c\u5224\u65ad\u7ed3\u675f\u540e\u7ed9b\u8d4b\u503c\uff0c\u5982\u679c\u4e3a\u771f\u5c31\u901a\u8fc7if\u8bed\u53e5\u8f93\u51fa\uff0c\u5982\u679c\u4e3a\u5047\u5219\u8df3\u8fc7\u5faa\u73af\uff08break\uff09\u3002
\u6269\u5c55\u8d44\u6599\uff1a
java\u4e2dbreak\u51fd\u6570\uff1a\u7528\u4e8eswitch\u8bed\u53e5\u5f53\u4e2d\uff0c\u7528\u4e8e\u7ec8\u6b62\u8bed\u53e5\u3002
\u8bd5\u9a8c\u4ee3\u7801\u5982\u4e0b\uff1a
\u8f93\u51fa\uff1a
\u53c2\u8003\u8d44\u6599\uff1a
\u767e\u5ea6\u767e\u79d1--break
public static void main(String[] args) { for (int i = 2; i = temp) { System.out.println(i + " is a prime"); } } } } }
public static void main(String[] args) {for (int i = 1; i <= 100; i++) {
//声明变量判断是否能被其它整除
boolean flage = false;
//其它数,表示从2开始,i-1结束
for (int j = 2; j < i; j++) {
//判断如果被其它数整除,那么这个数就不是素数
//结束次循环,并标识为不是素数
if(i%j==0){
flage = true;
break;
}
}
//如果判断结果为false,则说明不能被其它数整除
//那么这个数就是素数
if(!flage){
System.out.println(i);
}
}
}
int num=100;
Boolean b=false;
for(int i=0;i<num;i++)
{
for(int j=0;j<Math.sqrt(i);j++)
{
if(i%j==0)
{
b=true;
break;
}
}
if(!b)
{
System.out.println("这是素数："+i);
}
b=false;
}
public class test {
public static void main(String[] args) {
for(int i = 2;i < 100;i++) {
int count=0;
for(int j = 1;j <= i;j++) {
if(i%j == 0) {
count++;
}
}
if(count == 2) {
System.out.print(i+" ");
}
}
}
}
public class Sushu {
public static void main(String args[]){
for(int i=2;i<=100;i++){
if(fun(i))
System.out.println(i);
}
}
public static boolean fun(int i){
if(i==2)
return true;
int j;
for(j=2;j<=(int)Math.sqrt(i);j++)
if(i%j==0)
break;
if(j==(int)Math.sqrt(i)+1)
return true;
else
return false;
}
}
输出：
2
3
5
7
11
13
17
19
23
29
31
37
41
43
47
53
59
61
67
71
73
79
83
89
97
我觉得楼上这个从j=0开始取余不太合适吧
绛旓細package javaTest;public class Prime { public static void main(String[] args) { for(int n =1; n<=100; n++){ if(isPrime(n)){ System.out.println(n+"鏄礌鏁");continue;} } } public static boolean isPrime(int n){ boolean flag = true;if(n<鎺樻牳2)flag=false;else for(in...
绛旓細public static void main(String[] args) { for (int i = 1; i <= 100; i++) { //澹版槑鍙橀噺鍒ゆ柇鏄惁鑳借鍏跺畠鏁撮櫎 boolean flage = false;//鍏跺畠鏁,琛ㄧず浠2寮濮,i-1缁撴潫 for (int j = 2; j < i; j++) { //鍒ゆ柇濡傛灉琚叾瀹冩暟鏁撮櫎,閭ｄ箞杩欎釜鏁板氨涓嶆槸绱犳暟 //缁撴潫娆″惊鐜,骞舵爣璇嗕负...
绛旓細System.out.println("1--100涔嬮棿鐨勭礌鏁帮紙涔熺О璐ㄦ暟锛夌殑涓暟 -->"+count);System.out.println("1--100涔嬮棿鐨勭礌鏁帮紙涔熺О璐ㄦ暟锛夌殑涓暟涔嬪拰 -->"+sum);}
绛旓細int sum=0; for (int i = 2; i <= 100; i++) { // 璐ㄦ暟 for (int k = 2; k <= i; k++) { // 闄ゆ暟 // 鎺掗櫎鎵鏈夊湪 i=k 涔嬪墠 鑳借k鏁撮櫎(浣欐暟涓0)鐨勬暟 if (i % k == 0 && i != k) { break; } // 杈撳嚭鎵鏈夊湪 i=k 涓 i%k=0鐨勬暟 ...
绛旓細绱犳暟鏄寚鍙兘琚1鍜岃嚜韬暣闄ょ殑鏁帮紝鎵浠ュ厛瀹氫箟涓涓嚱鏁板垽鏂竴涓暟鏄惁鏄礌鏁帮紝鎺ョ潃浠1鍒100for寰幆鍒ゆ柇銆俻ackage baidu;public class Test {public static boolean fun(int n){if(n<2) return false;for(int i=2;i<n-1;i++)if(n%i==0) return false;return true;} public static void ...
绛旓細int sum=0;System.out.println("1鈥100鍐呯殑绱犳暟鏈夛細");for(int i=1;i<=100;i++){ boolean flag=true; for(int j=2;j<=i/2;j++){ if(i%j==0){ flag=false; break; } } if(flag){ System.out.print("\t"+i); sum+=i; }}System.out...
绛旓細涓嬮潰鏄鐢↗ava缂栧啓鐨勭▼搴忥紝鍙互瀹炵幇杈撳嚭1鍒100涔嬮棿鐨勬墍鏈夌礌鏁帮細Copy codepublic class Main { public static void main(String[] args) { for (int i = 2; i <= 100; i++) { // 鍒ゆ柇i鏄惁涓虹礌鏁 boolean isPrime = true;for (int j = 2; j < i; j++) { if (i % j == 0) ...
绛旓細1.import java.lang.Math;public class SuShu{ public static void main(String[] args){ int j;System.out.print("2 ");for(int i=3;i<=100;i+=2){ int k=(int)Math.sqrt(i)+1;for( j=2;j<=k;j++)if(i%j==0)break;if(j>=k)System.out.print(i+" ");} } } 2.pu...
绛旓細for(int i=100;i<=200;i++){ boolean isPrime = true;for(int j=2;j<=Math.sqrt(i);j++){ if(i%j==0){ isPrime = false;break;} } if(isPrime)System.out.print(i+" ");}
绛旓細100浠ュ唴绱犳暟鍙涓嶈兘琚10浠ュ唴鐨勭礌鏁版暣闄ゅ嵆鍙細1000浠ュ唴涓嶈兘琚100浠ュ唴鐨绱犳暟鏁撮櫎鍗冲彲 public static void main(String args[]) { ArrayList list = new ArrayList();for(int i = 0 ; i <= 100 ; i++){ if((i!=2)&&(i%2 == 0)) continue;if((i!=3)&&(i%3 == 0)) continue;if...
