Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Say if number is prime and give its factors
//Microsoft (R) C/C++ Optimizing Compiler Version 19.00.23506 for x86 #include <iostream> int factors(int num); int main() { int num{25}; std::cout << (factors(num) >2? " ==> not prime number " : " ==> prime number") << std::endl; //factors(num); return 0; } int factors(int num) { std::cout << "Factors of " << num << " are : "; int countFactors{0}; for(int i = 1; i <= num; i++){ if(num%i == 0){ std::cout << i << " "; ++countFactors; } } return countFactors; }
run
|
edit
|
history
|
help
0
Regex pipe and tabs c++
Removing __unaligned specifier partial solution
Templatized Visitor Pattern Example
Program_1_rstring
MSVC_example_fscanf_s_and_chars_wchars
Fibonacci stairs
hangman
codecvt wide string conversion with multibyte chars and locale + concatenation
😊
Triangle N5