输出0~100之间的所有质数。C语言 输出50到100所有质数的c语言编程
\u7528C\u8bed\u8a00\u8f93\u51fa100\u4e4b\u95f4\u7684\u6240\u6709\u8d28\u65701\u3001\u9996\u5148\u65b0\u5efa\u4e00\u4e2a\u7a7a\u767d\u7684c\u8bed\u8a00\u6587\u4ef6\uff0c\u5f15\u5165\u5934\u6587\u4ef6\uff0c\u5934\u6587\u4ef6\u4e2d\u5305\u62ecmath\u5e93\uff0c\u7a0d\u540e\u4f1a\u7528\u5230\uff0c\u5efa\u7acb\u4e3b\u51fd\u6570\uff1a
2\u3001\u4e3b\u51fd\u6570\u4e0a\u9762\u65b0\u5efa\u4e00\u4e2a\u5224\u65ad\u7d20\u6570\u7684\u51fd\u6570isPrime\uff0c\u5224\u65ad\u4f9d\u636e\u662f\u5c0f\u4e8e\u4ece2\u5230\u7b97\u6570\u5e73\u65b9\u6839\u7684\u6570\u5373\u662f\u7d20\u6570\u3002\u7136\u540e\u5728\u4e3b\u51fd\u6570\u4e2d\u904d\u53862\u5230100\u7684\u6570\uff0c\u8c03\u7528isPrime\u5224\u65ad\u6ee1\u8db3\u7d20\u6570\u6761\u4ef6\u5c31\u8f93\u51fa\uff1a
3\u3001\u5199\u5b8c\u4ee3\u7801\u6700\u540e\u6253\u5f00\u7f16\u8bd1\u540e\u7684\u8c03\u8bd5\u7a97\u53e3\uff0c\u5c4f\u5e55\u5c31\u4f1a\u6253\u5370\u51fa100\u4ee5\u5185\u7684\u6240\u6709\u6709\u7d20\u6570\u4e86\u3002\u4ee5\u4e0a\u5c31\u662f\u7528C\u8bed\u8a00\u8f93\u51fa100\u4e4b\u95f4\u7684\u6240\u6709\u7d20\u6570\u7684\u64cd\u4f5c\uff1a
/****\u7a0b\u5e8f\u8bf4\u660e:\u8d28\u6570\u4e5f\u53eb\u7d20\u6570\u3002*/#include #include //\u5224\u65ad\u6574\u6570\u662f\u5426\u4e3a\u7d20\u6570int isPrime(int n){ int i; for(i=2;i<=(int)sqrt(n);i++) //\u904d\u5386\u4ece2~n\u7684\u5e73\u65b9\u6839\u5411\u4e0b\u53d6\u6574 if(n%i == 0) //\u5982\u679c\u6709i\u80fd\u88abn\u6574\u9664\uff0c\u5219n\u4e0d\u662f\u7d20\u6570\uff0c\u8fd4\u56de0\uff0c\u5426\u5219\u8fd4\u56de1 return 0; return 1;}//\u6c42\u67d0\u4e00\u8303\u56f4\u5185\u7684\u6240\u6709\u7d20\u6570void qiuPrimeNumber(int start,int end){int i,j,count;for(i=start,count=0;i<=end;i++)if(isPrime(i)) //\u8c03\u7528\u7d20\u6570\u5224\u65ad\u51fd\u6570{printf("%-4d",i);count++;if(count % 10 == 0) //\u8f93\u51fa10\u4e2a\u7d20\u6570\u5219\u8f93\u51fa\u4e00\u4e2a\u6362\u884c{printf("\n");count=0;}}}int main(){printf("50~100\u4e4b\u95f4\u7684\u6240\u6709\u8d28\u6570\u4e3a:\n");qiuPrimeNumber(50,100); //\u8c03\u7528\u51fd\u6570\u6c42\u51fa50~100\u5185\u7684\u6240\u6709\u8d28\u6570return 0;}
int i,j;
printf("1~100的质数：
");
for(i = 2;i <= 100;i++){
for(j = 2;j < i;j++){
if(i%j == 0){
break;
}
}
if(j >= i)
printf(" %d ",i);
}
还有很多方法，要需要的话，可以跟我发邮件 [email protected]
#include <stdio.h>
int main ()
{
int i,j,k,t,N;
printf ("请输入范围\n");
scanf_s ("%d",&N);
for(k=0,i=0;i<N;i++)
{
for(t=0,j=1;j<=i;j++)
{
if( i%j) ;
else t++;
}
if (t==2) {
printf ("%4d ",i);
k++;
if (k%10) ;
else printf ("\n");}
}
printf ("\n%d内有质数%d个\n",N,k);
return 0;
}
绛旓細include <iostream.h> define size 100 void main(){ bool p[size];//鐢宠涓涓ぇ灏忎负100鐨bool鍨嬫暟缁勶紝p[i]鏄痶rue琛ㄧずi鏄川鏁帮紝涓嶈冭檻1锛2鍜100 cout<<size<<"浠ュ唴鐨勮川鏁鏈夛細2"; //2鏄剧劧鏄川鏁帮紝鎵浠ョ洿鎺杈撳嚭 int i;for(i=3;i<size;i+=2) //鎵鏈夊鏁伴兘鍙兘鏄川鏁帮紝鎵浠ヨ祴鍊...
绛旓細杈撳嚭100浠ュ唴鐨勮川鏁,鐢╟璇█濡備綍缂栧啓?.鐧惧害鐭ラ亾[寮曠敤鏃堕棿2017-12-25] 涓炬姤| 绛旀绾犻敊 | 璇勮 1 0 楸间笌闆ㄩ亣let 閲囩撼鐜:30% 鎿呴暱: 鏆傛湭瀹氬埗 鍏朵粬鍥炵瓟 妤间富浣犲ソ鐢ㄦ渶绠鍗曠殑鏂瑰紡缂栧啓鐨:#include<stdio.h> int main() { int i,j; int count=0; for(i=2;i<100;i++) { for(j=2;j<=i/2;j++...
绛旓細绱犳暟灏辨槸鍙兘琚 1 鍜屽畠鏈韩鎵鏁撮櫎鐨鏁般備粠2~100锛岄愪釜鍒ゆ柇绱犳暟锛屽鏋滄槸绱犳暟锛屽氨鎵撳嵃锛屽惁鍒欎笉鎵撳嵃銆傛簮浠ｇ爜濡備笅锛歝oding:utf-8 for i in range(2,101):fg = 0 for j in range(2,i-1):if i%j == 0:fg = 1 break if fg == 0:print(i)i = 2 c = []while i <= 100:j = ...
绛旓細public class TestSu { public static void main(String[] args) { int j;for (int i = 2; i <= 100; i++) // 1涓嶆槸绱犳暟锛屾墍浠ョ洿鎺ヤ粠2寮濮嬪惊鐜 { j = 2;while (i % j != 0) { j++; // 娴嬭瘯2鑷砳鐨勬暟瀛楁槸鍚﹁兘琚玦鏁撮櫎锛屽涓嶈兘灏辫嚜鍔 } if (j == i) // 褰撴湁琚暣闄...
绛旓細include<stdio.h> int main(){ int i,j;int count=0;for(i=2;i<100;i++){ for(j=2;j<=i/2;j++)if(i%j==0)//濡傛灉i鑳借j鏁撮櫎 灏变笉鏄璐ㄦ暟 閫鍑哄惊鐜 break;if(j>i/2){ count++;printf("%-3d",i);if(count%5==0)//褰撴瘡涓琛屾湁5涓暟鏃 鎹㈣ printf("\n");} }...
绛旓細printf("1鍒100鐨勮川鏁颁负锛歕n");for (i = 0; i < p - primes; i++) { printf("%d ", primes[i]);} printf("\n");return 0;} 鍦ㄤ笂杩颁唬鐮佷腑锛屾垜浠鍏堝畾涔変簡涓涓 int 绫诲瀷鐨勬暟缁 primes锛岃繖涓暟缁勭敤鏉ュ瓨鍌ㄦ壘鍒鐨勬墍鏈夎川鏁銆傜劧鍚庢垜浠畾涔変簡涓涓寚閽 p锛屽垵濮嬫椂鎸囧悜鏁扮粍 primes 鐨勯鍏冪礌...
绛旓細鍙傝冧唬鐮佸涓嬶細package test;public class Test { public static void main(String[] args) { int j;for (int i = 2; i <= 100; i++) // 1涓嶆槸绱犳暟锛屾墍浠ョ洿鎺ヤ粠2寮濮嬪惊鐜 { j = 2;while (i % j != 0)j++; // 娴嬭瘯2鑷砳鐨勬暟瀛楁槸鍚﹁兘琚玦鏁撮櫎锛屽涓嶈兘灏辫嚜鍔 if (j == i)...
绛旓細c#鍙傝:/*璐(绱)鏁版帹绠*/ List<int> 璐ㄦ暟闆 = new List<int>() { 2 }; bool 鍒 = true; int 鑼冨洿 = 999;string 浣嶆暟 = ""; foreach (int a in Enumerable.Range(0, 鑼冨洿.ToString().Length)) 浣嶆暟 += "0";foreach (int 鑷劧鏁 in Enumerable.Range(2, 鑼冨洿)){ foreach (...
绛旓細鍒╃敤寰幆锛岃杩欎釜鏁颁粠2闄ゅ埌寮鏍瑰彿鈥斺>for(i=2;i<=sqr(m);i++)鐒跺悗寰幆鍐呭垽鏂槸鍚﹁兘琚暣闄わ紝骞剁敤flag鍋氫釜鏍囪,鍒濆糵lag=1鈥斺>if(m%i==0)flag=0 寰幆瀹屾垚锛屽嵆鍒ゆ柇缁撴潫锛屽埄鐢ㄦ爣璁板垽鏂槸鍚︽槸璐ㄦ暟锛屽鏋滄槸锛岄偅涔坒lag搴旇杩樻槸涓1鈥斺>if(flag)printf鈥︹︿互涓婂氨鏄垽鏂儴鍒嗭紝閭ｄ箞浠1~100鍙互鍦...
绛旓細for(int i=2;i!=101;i++) {//寰幆閬嶅巻2-100鐨勬暟锛1涓嶆槸璐ㄦ暟 flag=1; for(int j=0;(j!=pos)&&(a[j]<=floor(sqrt(i)));j++) {//鏍规嵁璐ㄦ暟鍒ゆ柇瀹氱悊锛氣滃姝ｆ暣鏁皀锛屽鏋滅敤灏忎簬鎴栫瓑浜庢牴鍙穘鐨勬墍鏈夎川鏁鍘婚櫎锛 //鏃犳硶鏁撮櫎锛屽垯n涓鸿川鏁扳 锛宲os涔嬪墠鐨勪綅缃兘瀛樻斁浜嗚川鏁般
