Question

write a c program to find whether N is a super-prime or not
​

Answer 1

Answer:

Explanation:

#include<iostream>

using namespace std;

bool SieveOfEratosthenes(int n, bool isPrime[]) {

  isPrime[0] = isPrime[1] = false;

  for (int i=2; i<=n; i++)

     isPrime[i] = true;

  for (int p=2; p*p<=n; p++) {

     if (isPrime[p] == true) {

        for (int i=p*2; i<=n; i += p)

           isPrime[i] = false;

     }

  }

}

void superPrimes(int n) {

  bool isPrime[n+1];

  SieveOfEratosthenes(n, isPrime);

  int primes[n+1], j = 0;

  for (int p=2; p<=n; p++)

     if (isPrime[p])

  primes[j++] = p;

  for (int k=0; k<j; k++)

     if (isPrime[k+1])

  cout << primes[k] << " ";

}

int main() {

  int n = 343;

  cout << "Super-Primes less than "<< n << " are :"<<endl;

  superPrimes(n);

  return 0;

}