Complement: Using Boolean constant to calculate prime number algorithm

Enter the code:

/**copyright (c) 2014, College of Computer and Control engineering, Yantai University *all rights reserved.* file name: sum123.cpp*    Creator: Lin Haiyun * Completion date: December 26, 2014 * Version number: v2.0** Problem Description: Enter a number of positive integers to output the primes. * Program input: Number of indeterminate positive integers * program output: Prime numbers in output data */#include <iostream> #include <cmath>using namespace std;bool isprime (int n ); int main () {    int n;    while (Cin>>n)    {        if (IsPrime (n))            cout<<n<< "";    }    return 0;} BOOL IsPrime (int n) {    bool prime=true;    int K=int (sqrt (n));    for (int i=2;i<=k;i++)    {        if (n%i==0)        {            prime=false;            break;        }    }    return prime;}

Operation Result:

Summarize:

This knowledge point is a vacancy, has not done this knowledge point of practice. The exam only then know, now Add.

Complement: Using Boolean constant to calculate prime number algorithm