short number,n; bool prime; cin>>number; for(n=2;n

来源：学生作业帮编辑：作业帮分类：综合作业时间：2024/05/21 11:51:33

你的思路是对的,应该不会出现这样的情况.你看看这样写如何.
#include
#include
using namespace std;
int main(){
\x05short number,n;
\x05bool prime;
\x05cin>>number;
\x05if ( number 再答：不客气，我那个忘记用sqrt函数了。你是想用prime做判别标志对吧 #include #include using namespace std; int main(){ short number, n; bool prime = true; //prime为true时是质数 cin>>number; if ( numbe

short number,n; bool prime; cin>>number; for(n=2;n If teh n-th prime number is 47,the n if n=4p,where p is a prime number greater than 2 ,how many d SAT数学试题If n is any prime number greater than 2,which of the 一道sat2数学题,the only prime factors of a number 'n' are 2,5,7,a sat的数学题If n is ang prime number greater than 2, which of the natual number,counting number,whole number,even number,odd n 素数判断bool isprime(int n){if(n!=2 && n%2==0)return false;for(i main() { int number; printf("input a number\n"); if(number%2 while(cin>>n&&n)是什么意思? main() { int number; printf("input a number:\n"); scanf("%d" 英语翻译A.room's number B.rooms' number C.room number D.rooms' n