Question

How to check if the digits of a number are prime in C++

Answer 1

#include <iostream>

bool isPrime(int n) {
    // prime digits = 2, 3, 5, 7

    if (n == 2 || n == 3 || n == 5 || n == 7) {
        return true;
    }
    
    return false;
}

bool isDigitsPrime(unsigned int n) {
    while (n > 0) {
        if (!isPrime(n % 10)) {
            return false;
        }
        n = n / 10;
    }
    
    return true;
}

int main(void) {
    unsigned int n = 7355727;

    std::cout << (isDigitsPrime(n) ? "yes" : "no");
}

 
 
   
/*
run:
   
yes

*/

 

 

70+ SQL courses for beginners and professionals