给定一个正整数N，判定其是否是素数。

#include

using namespace std;

int main()

{

    int N;

    cin>>N;

    for(int i = 2;i

            cout

        cout

    cout

        cout

    int N;

    cin>>N;

    if(N

        cout

        cout

        cout

            cout

            cout

        case '+':

            cout

        prev_guess=guess;

        guess = (guess + x/guess)/2.0;

    }while(guess != prev_guess);

    return guess;

}

int main()

{

    double x;

    cin >>x;

    double sqrt_newton(double);

    cout

        cout

    int num, reverse = 0;

    cin>>num;

    while(num>0)

    {

        reverse = reverse *10+num%10;

        num/=10;

    }

    cout

        cout

            cout