c语言用筛选法求100之内的素数。（要求输出10个数一行） C语言编程：用筛选法求100以内素数，每行输出10个
C\u8bed\u8a00\u7f16\u7a0b:\u7528\u7b5b\u9009\u6cd5\u6c42100\u4e4b\u5185\u7684\u7d20\u6570,\u8981\u6c42\u6bcf\u969410\u884c\u8f93\u51fa\u3002\u600e\u4e48\u5199\uff1f#include
#include
#include
main()
{
int i,j,tem,n;
for(;;)
{
system("cls");
printf("\u8bf7\u8f93\u5165\u8981\u6c42\u7d20\u6570\u7684\u4e0a\u9650\u4e3a\uff1a\n");
scanf("%d",&n);
printf("2");
for(i=3;i<=n;i+=2)
{
tem=0;
for(j=2;tem==0&&j<sqrt(i);j++)
if(i%j==0)
tem=1;
if(tem==0)
printf(",%d",i);
}
printf("\n");
system("pause");
}
}
//\u8be5\u7d20\u6570\u7684\u6c42\u6cd5\uff0c\u6bd4\u7b2c\u4e00\u79cd\u65e0\u8bba\u662f\u5728\u65f6\u95f4\u590d\u6742\u5ea6\u8fd8\u662f\u7a7a\u95f4\u590d\u6742\u5ea6\u4e0a\u90fd\u8981\u7b80\u5355\u7684\u7684\u591a
//\u7d20\u6570\uff1a\u5176\u5b9e\u5076\u6570\u4e2d\u9664\u4e862\u4ee5\u5916\u90fd\u4e0d\u662f\u7d20\u6570\uff0c\u56e0\u6b64\u53ea\u6bd4\u8f83\u5947\u6570\u5373\u53ef\uff1b\u5f53\u5224\u65ad\u4e00\u4e2a\u6570\u662f\u4e0d\u662f\u7d20\u6570\u65f6\uff0c
//\u5f80\u5f80\u4e0d\u5fc5\u7b97\u662f\u5426\u80fd\u88ab2\u2014n-1\u4e2d\u4efb\u610f\u4e00\u4e2a\u6570\u6574\u9664
//\u53ea\u8981\u6bd4\u8f83\u662f\u5426\u80fd\u88ab2\u2014sqrt\uff08n\uff09\u4e2d\u7684\u4efb\u610f\u4e2a\u6570\u6574\u9664\u5373\u53ef\uff01
//\u5f53\u80fd\u88ab\u5176\u4e2d\u4e4b\u4e00\u6574\u9664\u65f6\uff0c\u5373\u80fd\u5224\u65ad\u8be5\u6570\u5df2\u4e0d\u662f\u7d20\u6570\uff0c\u6ca1\u6709\u5fc5\u8981\u518d\u5faa\u73af\u5224\u65ad\u4e86\uff01
//============================================================Mr_computer
\u4e0d\u7528a[]\u8fd9\u4e2a\u6570\u7ec4\u7684\uff0c\u76f4\u63a5\u5224\u65adj\u662f\u5426\u4e3a\u7d20\u6570\uff0c\u82e5\u662f\uff0c\u8f93\u51fa\uff0c\u4e0d\u662f\uff0c\u5224\u65ad\u4e0b\u4e00\u4e2a\uff0c\u6bcf\u884c\u8f93\u51fa\u5341\u4e2a\u5c31\u8bbe\u4e2a\u6807\u5fd7\uff0c\u591f\u5341\u4e2a\u4e86\u6362\u884c\u3002
#include<stdio.h>
int main(){
int i,j,flag=1,cnt=0;
for(i=2;i<=100;i++){
flag=1;
for(j=2;j*j<=i;j++){
if(i%j==0){
flag=0;
break;
}
}
if(flag==1){
printf("%2d ",i);
cnt++;
if(cnt%10==0 && cnt!=0) printf("
");
}
}
return 0;
}
count没有赋初值
绛旓細鎵浠ヤ笉鏄礌鏁 { return 0; //杩斿洖0锛岃鏄庝笉鏄礌鏁 } } return 1; //璇存槑n闄1鍜屾湰韬娌℃湁鍏朵粬绾︽暟锛屾墍浠ユ槸绱犳暟}void main(){ int i; for(i=1;i<=100;i++) //1..100涓涓竴涓绛涢 { if(isSushu(i)) //濡傛灉杩斿洖鍊兼槸1锛屽垯璇ユ暟鏄礌鏁帮紝...
绛旓細include<stdio.h> include<math.h> int main(void){ int num[100];int i,j,N;for(i=0;i<100;i++)/*鍒濆鍖栨暟琛*/ num[i]=i+1;num[0]=0;N=10;/*10鏄100寮骞虫柟寰楁潵鐨*/ for(j=1;;){/*j璁板綍褰撳墠鎵浣跨敤鐨绱犳暟*/ for(i=num[j]*(num[j]-1);i<1000;i++){ if(num[...
绛旓細pprime;int j = i + i;while (j <= MaxPrime){ isprime[j] = 0;j += i;} i++;} //for (int i = 0;i<=100;i++) cout << prime[i] << " ";//cout << endl;} 灏辨槸鍦ㄤ竴瀹氳寖鍥村唴姣忔绛涘幓璐ㄦ暟鐨勫嶆暟,鏈鍚庡墿涓嬫潵鐨勫氨鏄川鏁,鍏蜂綋鍙互鍙傝冩垜鐨勭▼搴,鏈変笉鎳傜殑鍙互闂垜 ...
绛旓細閫夋硶鏄竴绉嶆暟瀛︽柟娉 濡:姹1-100鐨璐ㄦ暟 閭ｄ箞浣犲彲浠 鍏 int a[101],i;for(i=1,i<101,i++)a[i]=i;鎶1鍒100璧嬬粰a[1]鍒癮[100]浣犲彲浠ヤ护鍏朵腑鐨2鐨勫嶆暟涓0 涓0鐨勪笉鍒ゆ柇 鍐嶄护3鐨勫嶆暟涓0 ...鏈鍚庤緭鍑 涓嶄负0鐨勬暟 鎬讳箣灏辨槸涓鎵规壒鐨勭瓫 ...
绛旓細include<stdio.h> void main() { int i,j,b,a[100],n;n=0;for ( i=2;i<100;i++ ) { b=1; for ( j=2;j<=i/2;j++ ) if ( i%j==0 ) {b=0;break;} if ( b!=0 ) {a[n]=i;n++;} } for ( i=0;i<n;i++ ) printf("%d ",a[i]); printf("\n");...
绛旓細include <stdio.h> int main( ){ int a[100],i,j;for(i=0;i<100;i++)a[i]=i+1;a[0]=0;for(i=1;i<100;i++){ if(a[i] == 0)continue;for(j=i+1;j<100;j++)if(a[j]%a[i] == 0)a[j] = 0;} j=0;for(i=0;i<100;i++){ if(a[i] != 0){ printf...
绛旓細i;while(scanf("%d",&n)){ prime(n);for(i=2;i<=n;i++)if(a[i])printf("%d\t",i);} return 0;} 杩欎釜鍙互灏10000000浠ュ唴鐨勬墍鏈夌礌鏁伴兘鑳借緭鍑 浣犲彧瑕姹100浠ュ唴鐨,鍦ㄨ繍琛岀▼搴忓悗杈撳叆100,鍥炶溅鍗冲彲 鎴戜笅闈㈢殑杩欎釜濂藉儚娌＄敤鍒板埆鐨勫惂,鎴戜笂闈㈢殑鍙槸涓轰簡杈撳嚭鏃堕棿鎵嶅啓鐨,浣犵湅涓嬮潰鐨勫氨琛屼簡 ...
绛旓細include<iostream.h> include<math.h> int main(){ int i,j,k,n,m=0;for(i=2;i<=100;i++){ k=sqrt(i); //鐢ㄥ紑鏂圭殑鏂规硶姹傛晥鐜囨槸鏈楂樼殑锛沠or(j=2;j<=k;j++)if(i%j==0)break;if(j==k+1){ cout<<i<<" ";m++;if(m%10==0)//鍗佷釜鏁版崲涓琛岋紱{ cout<<endl;m=...
绛旓細include "math.h"bool IsPrime(int x){ int i, s;s = sqrt(x + 1);for(i = 2; i <= s; i++)if(x % i == 0) return false;return true;} void main( ){ int i;for(i = 2; i < 100; i++)if(IsPrime(i))printf("%d ", i);} 涔熷彲閲囩敤绛涢夋硶锛岀瓫閫夋硶鏁堢巼浼氶珮...
绛旓細涓嶇敤浣犻偅涔堝鏉傘俰nt i,j,k=0;for(i=2;i<=100;i++)for(j=2;j<=i;j++){ if(i/j==0)break;} if(i==j){ a[k++]=i;}
