//Code by Madhav /* Semiprime Numbers A semiprime number is a natural number that is the product of exactly two (not necessarily distinct) primes. For example: Input: 57 Output: true (57 is a semiprime number because it is the product of two primes, 57 = 3 * 17) Input: 121 Output: true (121 is a semiprime number because it is the product of two primes, 121 = 11 * 11) Input: 186 Output: false (186 is not a semiprime number because it is the product of three primes: 186 = 2 * 3 * 31) -------------------------------------- NOTE : 1.For between a Range , enter starting no. and ending no. eg. 1 3000 -------------------------------------- */ #include using namespace std; //to check primes bool isprime(unsigned int i) { for(unsigned j=2;j*j<=i;j++) { if(i%j==0||i<2) { return false ; } } return true ; } //to check semiprimes bool isSemiprime(unsigned int n) { for(unsigned int i=2;i*i<=n;i++) { if(n%i==0&&isprime(i)&&isprime(n/i)) { return true; } } return false; } //Nothing of importance void ATag(); int main() { //Nothing of importance ATag(); //Defining variables unsigned int input1,input2; bool check = true ; //A predefined input if none is given input1 = 187 ; //Taking Input cin>>input1; input2=input1; cin>>input2; //FailSafe if (input1 < 0 || input2 < 0) { cout<<"ERROR : Input number should be greater than Zero...."; return 0; } //if range is not in order then swap if(input2 < input1 ) { input2 = input1 + input2 ; input1 = input2 - input1 ; input2 = input2 - input1 ; } //Code to display text on console cout<<"Your input : "<