Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Prime_Number_Cpp
//Title of this code //g++ 4.9.1 #include <iostream> using namespace std; class Prime_Number { private: int primeNumber; public: Prime_Number(int tempNum) { primeNumber=tempNum; } int testPrime(){ int count; count = 2; while(count < primeNumber && primeNumber % count !=0 ) { count = count + 1; } return(count); } }; int main(){ int n,result;n=19; Prime_Number p(n); result = p.testPrime(); if(n==result){ cout<<n<<" is a prime number" <<endl; }else{ cout<<n<<" is not a prime number"<<endl; }return 0; }
run
|
edit
|
history
|
help
0
test111
Palindromy
SpiralMatrix
Cyclically rotate an array by one
Quiz 12/13
A+B ორობით სისტემაში
QP
Boost adapters foreach
Tree
First and last Occurence of an Element