Write a complete program that reads at most 30 positive integer values, or it wi

Question

Write a complete program that reads at most 30 positive integer values, or it will stops reading if the user enters -9999
If the user enters a negative number, the number should not be accepted and he should have the chance to re-enter the number again.

After you stop reading integers from keyboard, the program should be successfully calculate and print the following:

The number of integers between 0 & 200 is: …
The number of integers between 200 & 500 is:….
The number of integers above 500 is:…
The number of primes is:….
The maximum prime number entered is:
The maximum number among all integers is:….

Explanation / Answer

please rate - thanks

which group does the 200 go in? I put it in 0-200

#include <iostream>
using namespace std;
bool isPrime(int);
int main()
{int n,i=0,to200=0,to500=0,greater500=0,primes=0,bigprime=0,big=0;
cout<<"enter a number > 0 (-9999 to exit): ";
cin>>n;
while(cin&&i<30&&n!=-9999)
   {while(n<0)
      {cout<<"must be>=0 ";
      cout<<"enter a number > 0: ";
       cin>>n;
       }
       i++;
       if(n<=200)
           to200++;
       else if(n<=500)
           to500++;
       else
           greater500++;
       if(n>big)
           big=n;
       if(isPrime(n))
          {primes++;
           if(n>bigprime)
               bigprime=n;
           }
        cout<<"enter a number > 0 (-9999 to exit): ";
        cin>>n;  
       }
cout<<"The number of integers between 0 & 200 is: "<<to200<<endl;
cout<<"The number of integers between 200 & 500 is: "<<to500<<endl;
cout<<"The number of integers above 500 is: "<<greater500<<endl;
cout<<"The number of primes is: "<<primes<<endl;
cout<<"The maximum prime number entered is: "<<bigprime<<endl;
cout<<"The maximum number among all integers is: "<<big<<endl;   
system("pause");
return 0;
}
bool isPrime(int n)
{int j;
for(j=2;j<n;j++)
   if(n%j==0)               //if you find a factor the number isn't prime
      return false;
return true;                // get here only if no factors
}

#include <iostream>
using namespace std;
bool isPrime(int);
int main()
{int n,i=0,to200=0,to500=0,greater500=0,primes=0,bigprime=0,big=0;
cout<<"enter a number > 0 (-9999 to exit): ";
cin>>n;
while(cin&&i<30&&n!=-9999)
   {while(n<0)
      {cout<<"must be>=0 ";
      cout<<"enter a number > 0: ";
       cin>>n;
       }
       i++;
       if(n<=200)
           to200++;
       else if(n<=500)
           to500++;
       else
           greater500++;
       if(n>big)
           big=n;
       if(isPrime(n))
          {primes++;
           if(n>bigprime)
               bigprime=n;
           }
        cout<<"enter a number > 0 (-9999 to exit): ";
        cin>>n;  
       }
cout<<"The number of integers between 0 & 200 is: "<<to200<<endl;
cout<<"The number of integers between 200 & 500 is: "<<to500<<endl;
cout<<"The number of integers above 500 is: "<<greater500<<endl;
cout<<"The number of primes is: "<<primes<<endl;
cout<<"The maximum prime number entered is: "<<bigprime<<endl;
cout<<"The maximum number among all integers is: "<<big<<endl;   
system("pause");
return 0;
}
bool isPrime(int n)
{int j;
for(j=2;j<n;j++)
   if(n%j==0)               //if you find a factor the number isn't prime
      return false;
return true;                // get here only if no factors
}

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.