/C++/Comment savoir si un nombre est premier c++

Comment savoir si un nombre est premier c++

#include <conio.h> 
#include <iostream>
using namespace std;
int main() {
  int x, a;
  cout << "Enter The No. :";
  cin >> x;
  int prime(unsigned int);
  a = prime(x);
  if (a == 1)
    cout << "It Is A Prime No." << endl;
  else
  if (a == 0)
    cout << "It Is Composite No." << endl;
  getch();
}

int prime(unsigned int x) {
  if (x == 1) {
    cout << "It Is Neither Prime Nor Composite";
    return 2;
  }
  if (x == 2 || x == 3 || x == 5 || x == 7)
    return 1;
  if (x % 2 != 0 && x % 3 != 0 && x % 5 != 0 && x % 7 != 0)
    return 1;
  else
    return 0;
}

Source: it-swarm-fr.com

Comment savoir si un nombre est premier c++

bool check_prime(int num) {
for (int i = num - 1; i > 1; i--) {
    if ((num % i) == 0)
        return false;
}
return true;
}

Source: it-swarm-fr.com

Similar codes

0 vote106 views1 answer
C++ Attribute Parser
C++
0 vote97 views1 answer
C++ pointer to base class
C++
0 vote103 views1 answer
C++ fast
C++
0 vote95 views1 answer
123213
C++
2 votes98 views1 answer
C++ for competitive programming
C++
0 vote110 views1 answer
C++ map values range
C++
1 vote106 views1 answer
Print hello world on c++
C++
0 vote104 views1 answer
C++ to assembly
C++
0 vote92 views1 answer
Enter the value of integer n. Print the figure as shown below.(3) Sample input 5 Sample output ***** **** *** ** *
C++
2 votes98 views1 answer
C++ virtual function in constructor
C++