c语言程序中怎样输出1到100的素数 c语言程序设计实验 输出1到100之间的素数。
C\u8bed\u8a00 \u8f93\u51fa1\u5230100\u4e4b\u95f4\u7684\u5168\u90e8\u7d20\u6570\uff1f\u6709\u4e09\u79cd\u65b9\u6cd5\uff1a
1\u3001\u8f93\u51fa1-100\u4ee5\u5185\u7684\u7d20\u6570\uff1a
2\u3001\u540c\u6837\uff0c\u4e5f\u662f\u8f93\u51fa1-100\u4ee5\u5185\u7684\u7d20\u6570\uff0c\u8fd9\u4e2a\u6784\u9020\u4e00\u4e2a\u6570\u7ec4\uff0c\u5c06\u5176\u6240\u6709\u5143\u7d20\u521d\u59cb\u5316\u4e3a1\uff0c\u8868\u793a\u7d20\u6570\uff0c\u8fd9\u65f6\u53d6x\u4ece2\u5f00\u59cb\uff0c\u5230100\u4ee5\u5185\u505a\u5faa\u73af\u3002
\u82e5x\u4e3a\u7d20\u6570\uff0c\u5373prime[x]\uff01=0\uff0c\u4f7f\u5f97\u6bcf\u4e2ai*x\u4f4d\u7f6e\u5143\u7d20\u7f6e0\uff08prime[i*x]=0\uff09\uff0c\u8868\u793a\u4e3a\u975e\u7d20\u6570\uff0c\u5faa\u73af\u7ed3\u675f\u524dx+1\u3002
3\u3001\u8be5\u65b9\u6cd5\u662f\u8f93\u51fa100\u4e2a\u7d20\u6570\uff0c\u57fa\u672c\u601d\u60f3\u662f\u6784\u9020\u4e00\u4e2a\u7d20\u6570\u8868\uff0c\u5229\u7528\u51fd\u6570\u5224\u65ad\u6bcf\u4e2a\u6570\u662f\u5426\u80fd\u88ab\u5176\u4e4b\u524d\u7684\u7d20\u6570\u6574\u9664\uff0c\u5982\u679c\u4e0d\u80fd\uff0c\u5219\u5728\u7d20\u6570\u8868\u5185\u52a0\u4e0a\u8be5\u5143\u7d20,\u4e0d\u65ad\u5faa\u73af\uff08while\u5faa\u73af\u7ed3\u675f\u6761\u4ef6\u662fcnt\u5373\u6570\u7ec4\u4e2a\u6570>100\uff09\u3002
\u6269\u5c55\u8d44\u6599\uff1a
\u5728\u8fd9\u4e2a\u5c0f\u7a0b\u5e8f\u4e2d\u4e3b\u8981\u7528\u5230\u7684\u662ffor\u5faa\u73af
for \u5faa\u73af\u8bed\u53e5\u7684\u4e00\u822c\u5f62\u5f0f\u4e3a\uff1a
for (\u8868\u8fbe\u5f0f1; \u8868\u8fbe\u5f0f2; \u8868\u8fbe\u5f0f3)
{
\u8bed\u53e5;
}
\u9700\u8981\u6ce8\u610f\u7684\u4e24\u70b9\uff1a
1) \u8868\u8fbe\u5f0f1\u3001\u8868\u8fbe\u5f0f2\u548c\u8868\u8fbe\u5f0f3\u4e4b\u95f4\u662f\u7528\u5206\u53f7;\u9694\u5f00\u7684\uff0c\u5343\u4e07\u4e0d\u8981\u5199\u6210\u9017\u53f7\u3002
2) for(\u8868\u8fbe\u5f0f1\uff1b\u8868\u8fbe\u5f0f2\uff1b\u8868\u8fbe\u5f0f3)\u7684\u540e\u9762\u5343\u4e07\u4e0d\u8981\u52a0\u5206\u53f7\uff0c\u5f88\u591a\u65b0\u624b\u90fd\u4f1a\u72af\u8fd9\u79cd\u9519\u8bef\u2014\u2014\u4f1a\u60c5\u4e0d\u81ea\u7981\u5730\u5728\u540e\u9762\u52a0\u5206\u53f7\u3002
\u56e0\u4e3a for \u5faa\u73af\u53ea\u80fd\u63a7\u5236\u5230\u5176\u540e\u7684\u4e00\u6761\u8bed\u53e5\uff0c\u800c\u5728C\u8bed\u8a00\u4e2d\u5206\u53f7\u4e5f\u662f\u4e00\u4e2a\u8bed\u53e5\u2014\u2014\u7a7a\u8bed\u53e5\u3002\u6240\u4ee5\u5982\u679c\u5728\u540e\u9762\u52a0\u4e2a\u5206\u53f7\uff0c\u90a3\u4e48 for \u5faa\u73af\u5c31\u53ea\u80fd\u63a7\u5236\u5230\u8fd9\u4e2a\u5206\u53f7\uff0c\u4e0b\u9762\u5927\u62ec\u53f7\u91cc\u9762\u7684\u8bed\u53e5\u5c31\u4e0d\u5c5e\u4e8e for \u5faa\u73af\u4e86\u3002
int main(){ int i, j; for (i = 2; i i){//\u5982\u679c\u6ca1\u6709\u80fd\u6574\u9664\u7684\u6570\uff0c\u8bf4\u660e\u662f\u7d20\u6570\uff0c\u8f93\u51fa printf ("%d\n", i); } } return 0;}
定义一个求判断素数的函数，调用此函数对1~100中2和大于2的奇数进行判断，是素数的输出，举例代码如下：
#include "stdio.h"
int prime(int n){//判断n是否为素数
int i;
if(n>2 && !(n&1) || n<2)
return 0;
for(i=3;i*i<=n;i+=2)
if(!(n%i))
return 0;
return 1;
}
int main(int argc,char *argv[]){
int n;
for(n=2;n<100;n += n!=2 ? 2 : 1)
if(prime(n))
printf("%3d",n);
printf("
");
return 0;
}
#include<stdio.h>
void main()
{
int a,b,c;
for(a=1;a<=100;a++)
{
for(b=1,c=0;b<=a;b++)
if(a%b==0) c++;
if(c<=2) printf("%d",a);
}
}
这个我已经试验过的,是正确的......
#include <stdio.h>
#include <stdlib.h>
int IsPrime(int n)
/*判断n是否是素数*/
{
int i = 0;
for(i=2;i<n;i++)
{
if(n%i==0)
return 0;
}
return 1;
}
void main(void)
{
int i = 0;
for( i = 1; i < 100; i++)
{
if(IsPrime(i))
{
printf("%3d",i);
}
}
}
绛旓細绱犳暟鍒ゆ柇锛氬皢璇ユ暟N鐢ㄥ皬浜庣瓑浜庢牴鍙種鐨勬墍鏈夌礌鏁板幓璇曢櫎锛岃嫢鍧囨棤娉曟暣闄わ紝N鍒欎负绱犳暟銆傚弬鑰冧唬鐮侊細include<stdio.h>#include<math.h>int main(){ int a,b,c; printf("2\n");//2鏄礌鏁帮紝涓嶈兘鍒╃敤涓婇潰鐨勮鍒欐眰鍑洪渶瑕佸彟澶杈撳嚭銆 for(a=2;a<=100;a++) { c = (int)sqrt(a);...
绛旓細鎸夌収浣犵殑绋嬪簭浣滀簡淇敼锛岀畝鍖栦簡绠楁硶锛岀▼搴忓涓嬶細#include<stdio.h>#include<math.h>intmain(){inta,b,k;/*printf("2");*/for(a=1;a<=100;a=a+2) { k=sqrt(a); for(b=2;b<k;b++) if(a%b==0)break; if(b>=k)printf("%d\t",a); }getch();return0;}绋嬪簭鐨勮繍琛岀粨鏋...
绛旓細include <stdio.h> int isprime(int n){for(int i=2;i*i<=n;i++)if(n%i==0)return 0;return n>1;} int main(){int n=0,i;for(i=2;i<101;i++)if(isprime(i)){printf("%d ",i);n++;} printf("\nToatl=%d\n",n);return 0;} ...
绛旓細include <stdio.h> int prime(int n){ int i;if(n<2)return 0;for(i=2;i*i<=n;++i)if(n%i==0)return 0;return 1;} int main(){ int i;for(i=1;i<100;++i)if(prime(i))printf("%d ",i);return 0;}
绛旓細include<stdio.h> include<windows.h> int f(int n){if(n<2)return 0;int i;for(i=2;i<=n/2;i++)if(n%i==0)return 0;return 1;} int main(){int i;for(i=1;i<=100;i++)if(f(i))printf("%5d",i);system("pause"); } ...
绛旓細鍛介鈥滃浜1<x<100鐨勫悎鏁皒, 蹇呭惈鏈夊皬浜10鐨勮川鍥犲瓙鈥濆彲浠ヨ瘉鏄庢槸鐪熷懡棰橈紝瀹冪殑閫嗗弽鍛介鈥滃浜1<x<100鐨勬暟锛屽鏋滀笉鍚湁灏忎簬10鐨勮川鍥犲瓙锛屽垯瀹冨繀涓虹礌鏁般傗濆垯涔熸槸鐪熷懡棰樸傚洜姝ょ瓫闄ゆ椂锛屽彧瑕佺瓫闄ゅ惈鏈10浠ュ唴鐨勮川鍥犲瓙鐨勬暟灏卞彲浠ヤ簡銆備笅闈㈢粰鍑虹瓫閫夋硶鐨勪唬鐮併俰nclude "stdio.h"void main( ){ bool ...
绛旓細include <math.h> int is_prime(long digit) { long i;long sq=(long)sqrt((double)digit);int value=1;for(i=2; i<=sq; i++) { if (digit % i ==0) { value = 0;break;} } return value;} int main(void) { int i,count;count = 0;for(i=2; i<100; i++) { if...
绛旓細鐐瑰嚮娣诲姞灏辨柊寤哄ソ鏂囦欢浜嗭紝涔嬪悗灏卞彲浠ョ紪鍐欎唬鐮佷簡锛3銆佽繖閲屽鏁板氨鏄櫎浠2涔嬪悗鏈変綑鏁扮殑鏁存暟锛屾墍浠ョ▼搴忔瘮绠鍗曪紝鍦╢or寰幆閲屽垽鏂100浠ュ唴鐨勬暟鏄惁濂囨暟锛屾槸鐨勮瘽灏辩浉鍔狅紝鏈鍚杈撳嚭缁撴灉灏辫浜嗭細4銆佹寜涓嬪揩鎹烽敭crtl+F5杩愯绋嬪簭锛屽氨鍙互寰楀埌璁＄畻缁撴灉浜嗐備互涓婂氨鏄敤鐢c璇█绋嬪簭姹1鑷100涔嬮棿鍏ㄩ儴濂囨暟涔嬪拰鐨勬紨绀虹▼搴忥細
绛旓細if (i == k + 1) { printf("%d ", j); } } } } 杈撳叆鍊兼槸100灏卞彲浠ユ眰100浠ヤ笅鐨勮川鏁帮紝涓轰簡浣犳柟渚挎垜娌℃湁鎶婃暟瀛楀啓姝汇
绛旓細include <stdio.h> void main(){ int i, j;for (i = 1; i < 10; i++){ for (j = 0; j < 10; j++){ if (i * j > i + j)printf("%d ", i * 10 + j); //杈撳叆鍗佷綅涓篿鏃讹紝婊¤冻鏉′欢鐨勬暟 } printf("\n"); //鎹㈣ } } ...
