/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

3 votes162 views2 answers
Last element of a set in c++
C++
4 votes136 views3 answers
C++ how to get maximum value
C++
35 votes143 views6 answers
Ellipsis
C++
2 votes133 views1 answer
C++ code for insertion sort
C++
8 votes141 views3 answers
Stack implementation using class in c++
C++
1 vote132 views1 answer
Lower bound c++
C++
0 vote143 views1 answer
C++ get pointer from unique_ptr
C++
14 votes118 views1 answer
Dynamically generating 2d array in cpp
C++
0 vote134 views1 answer
C++ split string by several space
C++
0 vote150 views1 answer
Find largest number in each row in array c++ using function
C++