写一个判素数的函数，在主函数输入一个整数，输出是否为素数的信息。用C语言编写。 写一个判别素数的函数，在主函数输入一个整数，输出是否是素数的...
\u7528C\u8bed\u8a00\u5199\u4e00\u4e2a\u5224\u7d20\u6570\u7684\u51fd\u6570\uff0c\u5728\u4e3b\u51fd\u6570\u8f93\u5165\u4e00\u4e2a\u6574\u6570\uff0c\u8f93\u51fa\u662f\u5426\u7d20\u6570\u7684\u4fe1\u606f\u3002\u8f93\u51fa\u662f\u5426\u7d20\u6570\u7684\u4fe1\u606f\u7684\u6e90\u4ee3\u7801\u5982\u4e0b\uff1a
#include
#include
bool prime(int x){
if (2 > x ) {
return false;
}
for (int i = 2; i < x ; i++) {
if (0 == x % i ) {
return false;
}
}
return true;
}
int main(){
for (int i = 2; i < 100; i++) {
if (prime(i)) {
printf("%d ",i);
}
}
printf("\n");
return 0;
}
\u6269\u5c55\u8d44\u6599
1\u3001\u51fd\u6570\u7684\u4f7f\u7528\u53ef\u4ee5\u8eab\u6545\u91cd\u590d\u4ee3\u7801\u7684\u7f16\u5199\u3002
2\u3001\u51fd\u6570\u4f7f\u5f97\u7a0b\u5e8f\u66f4\u52a0\u6a21\u5757\u5316\uff0c\u6709\u5229\u4e8e\u7a0b\u5e8f\u7684\u9605\u8bfb\u4fee\u6539\u548c\u5b8c\u5584\u3002
3\u3001\u7d20\u6570\u5c31\u662f\u6ca1\u6709\u56e0\u5b50\u7684\u6570\uff0c\u53ea\u80fd\u88ab1\u548c\u672c\u8eab\u6574\u9664\uff0c\u6240\u4ee5\u6211\u4eec\u5c31\u53ef\u4ee5\u7528\u5faa\u73af\u89e3\u51b3\uff0c\u5faa\u73af\u7528\u4e8e\u4ece2\u5230\u4ed6\u7684\u6839\u5f0f\u5224\u5b9a\u662f\u5426\u6709\u5176\u4ed6\u6570\u53ef\u4ee5\u6574\u9664\u5b83\uff0c\u6709\u5c31\u8df3\u51fa\u5faa\u73af\u3002
#include #include //\u5224\u65ad\u662f\u5426\u4e3a\u7d20\u6570\u7684\u51fd\u6570int isPrime(int n){ int i=2; while(i<=(int)sqrt(n)) { if(n%i == 0) return 0; //\u4e0d\u662f\u7d20\u6570\uff0c\u76f4\u63a5\u8fd4\u56de0 else i++; } return 1;}int main(){ int n; printf("\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570: "); scanf("%d",&n); if(isPrime(n)) printf("%d is a prime number\n",n); else printf("%d is not a prime number\n",n); return 0;}\u4f8b\u8fd0\u884c\u7ed3\u679c\uff1a
\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570: 29
29 is a prime number
\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570: 25
25 is not a prime number
#include <stdio.h>
int prime( int n )
{
int i;
if ( n<2 )
return 0;
for( i=2;i<=n/2;i++ )
{
if ( n%i==0 )
return 0;
}
return 1;
}
int main()
{
int i;
printf("input n: ");
scanf("%d", &i );
if ( prime(i) )
printf("%d is prime!", i );
else
printf("%d is not prime!", i );
printf("
");
return 0;
}
#include<stdio.h>
int IsPriNum(int a)
{
int i,j=0;
if(a<=0)
return 0;
else if(a==1||a==2)
return 1;
else
{
for(i=2;i<a;i++)
{
if(a%i==0)
j++;
}
if(j==0)
return 1;
else return 0;
}
}
int main()
{
int num;
printf("请输入一个数:");
scanf("%d",&num);
if(IsPriNum(num))
printf("素数!\n");
else
printf("不是素数!\n");
return 0;
}
#include<stdio.h>
int pdss(int i)
{
int j;
for(j=2;j<i;j++)
if(i%j==0)
break;
if(i==j)
return 1;
return 0;
}
main()
{
int j,n;
printf("请输入一个整数:");
scanf("%d",&n);
j= pdss(n);
if(j==1)
printf("是素数\n");
if(j==0)
printf("不是素数\n");
}
绛旓細include <stdio.h> int fun_m(int x);int main(){ int m;while(1){ printf("璇疯緭鍏ユ暟瀛(杈撳叆0閫鍑)锛");scanf("%d",&m);if (m == 0){ return 0;} if (fun_m(m)){ printf("%d鏄绱犳暟锛",m);} else { printf("%d涓嶆槸绱犳暟锛",m);} } return 0;} int fun_m(int x)...
绛旓細int fun(int x){ int i;for(i=2;i<x;i++){ if(x%i==0)杈撳嚭x涓嶆槸绱犳暟;else 杈撳嚭x鏄礌鏁;} }
绛旓細include<stdio.h> void main(){ int i,j,x;printf("杈撳叆浣犺娴嬭瘯鐨勬暟瀛:\n");scanf("%d",&x);j=1;for(i=2;i<x;i++)if(x%i==0){ j=0;i=x;} if(j==0)printf("杩欎釜鏁颁笉鏄涓涓礌鏁!\n\n");else printf("杩欎釜鏁版槸涓涓礌鏁!\n\n");} ...
绛旓細1銆佹墦寮visual C++ 6.0锛岀偣鍑汇愭枃浠躲-銆愭柊寤恒-銆愭枃浠躲戯紝鐒跺悗閫夋嫨銆怌++ Source File銆戯紱2銆佽緭鍏ラ澶勭悊鍛戒护鍜涓诲嚱鏁锛歩nclude<stdio.h> /*鍑芥暟澶达細杈撳叆杈撳嚭澶存枃浠*/ void main() /*绌虹被鍨嬶細涓诲嚱鏁*/ 3銆佸畾涔夊彉閲忓苟杈撳叆涓涓暟瀛楋細int m,i; /*瀹氫箟鍙橀噺鐨勬暟鎹被鍨嬩负鏁村瀷*/ printf(...
绛旓細Boolean is_Prime(int n);Boolean is_Prime(int n){ int i;for(i = 2; i < n && n%i != 0; i++);return n == i ? PRIME : NOT_PRIME;} void main(void){ int n;printf("璇疯緭鍏ヤ竴涓暟锛");scanf("%d", &n);PRIME == is_Prime(n) ? printf("%d鏄绱犳暟\n",n) : ...
绛旓細include<stdio.h>int prime(int n){for(int i=2; i*i<=n;i++) if(n%i==0)return 0; return n>1;}int main(){int n; scanf("%d",&n); if(!prime(n))printf("涓"); printf("鏄绱犳暟\n"); return 0; }
绛旓細澶氱殑鎴戝氨涓嶈浜,鍑芥暟濡備笅(浣犲彧闇鎶婁笅闈㈢殑浠ｇ爜璐村湪int main()涔嬪墠灏辫浜,鐒跺悗鍦ㄥ紑澶村姞涓涓ご鏂囦欢:#include<cmath>):bool isPrime(int x){if(x==1)return 0;for(int i=2;i<=sqrt(x);i++) if(x%i==0)return 0;return 1;}鍑芥暟灏辨槸涓婇潰鐨,浣跨敤鏂规硶:姣斿浣犳兂鍒ゆ柇n(杩欓噷n涓烘鏁存暟)鏄惁涓绱犳暟,...
绛旓細鎻愪緵涓涓狢鐨勪綔鍙傝冿細include "stdio.h"int prime(int 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(void){ int n; while(1){ printf("Input n(int n>0)...\nn="...
绛旓細include<stdio.h>int main(int argc,char**argv){ int sushu(int x); int a,m; scanf("%d",&a); m=sushu(a);//鎺ユ敹鍒ゆ柇璐ㄦ暟鐨缁撴灉锛1涓鸿川鏁帮紝0灏变笉鏄川鏁 if(m==1) { printf("$d is a prime",a);//杈撳嚭璐ㄦ暟 } else { printf("%d is not...
绛旓細bool isPrime(int num){ if (num != 2 && num % 2 == 0) //闄2浠ュ鐨勫伓鏁伴兘涓嶆槸绱犳暟 { return false;} for (int i = 3; i <= sqrt(num); i += 2) //寰幆涓彧灏濊瘯濂囨暟锛屽洜涓哄伓鏁伴兘宸茬粡琚帓闄や簡 { if (num % i == 0){ return false;} } return true;} void main()...
