判断一个数是否是素数的程序讲解main(){int m,i,k;scanf(%d,&m);k=sqrt(m);for(i=2;i=k+1)printf(%d is a prime number\n,m);elseprintf(%d is not a prime number\n,m);}不懂啊,高人请细讲一下吧
来源:学生作业帮助网 编辑:作业帮 时间:2024/06/26 04:11:36
![判断一个数是否是素数的程序讲解main(){int m,i,k;scanf(%d,&m);k=sqrt(m);for(i=2;i=k+1)printf(%d is a prime number\n,m);elseprintf(%d is not a prime number\n,m);}不懂啊,高人请细讲一下吧](/uploads/image/z/680368-40-8.jpg?t=%E5%88%A4%E6%96%AD%E4%B8%80%E4%B8%AA%E6%95%B0%E6%98%AF%E5%90%A6%E6%98%AF%E7%B4%A0%E6%95%B0%E7%9A%84%E7%A8%8B%E5%BA%8F%E8%AE%B2%E8%A7%A3main%28%29%7Bint+m%2Ci%2Ck%3Bscanf%28%25d%2C%26m%29%3Bk%3Dsqrt%28m%29%3Bfor%28i%3D2%3Bi%3Dk%2B1%29printf%28%25d+is+a+prime+number%5Cn%2Cm%29%3Belseprintf%28%25d+is+not+a+prime+number%5Cn%2Cm%29%3B%7D%E4%B8%8D%E6%87%82%E5%95%8A%2C%E9%AB%98%E4%BA%BA%E8%AF%B7%E7%BB%86%E8%AE%B2%E4%B8%80%E4%B8%8B%E5%90%A7)
判断一个数是否是素数的程序讲解main(){int m,i,k;scanf(%d,&m);k=sqrt(m);for(i=2;i=k+1)printf(%d is a prime number\n,m);elseprintf(%d is not a prime number\n,m);}不懂啊,高人请细讲一下吧
判断一个数是否是素数的程序讲解
main()
{
int m,i,k;
scanf(%d,&m);
k=sqrt(m);
for(i=2;i=k+1)
printf(%d is a prime number\n,m);
else
printf(%d is not a prime number\n,m);
}
不懂啊,高人请细讲一下吧
判断一个数是否是素数的程序讲解main(){int m,i,k;scanf(%d,&m);k=sqrt(m);for(i=2;i=k+1)printf(%d is a prime number\n,m);elseprintf(%d is not a prime number\n,m);}不懂啊,高人请细讲一下吧
首先先要知道如何判断一个素数啊,程序里k代表要判断的数,如果这个数能被2~它的平方根中的任一数整除的话它就不是素数了,否则就是素数.这里程序也是这个思想,你应该懂吧.