Finding all primes from 1 to n
bool prime [ n + 1 ] ; memset ( prime , true , sizeof ( prime ) ) ; sieve ( n , prime ) ; cout << " The ▁ prime ▁ triplets ▁ from ▁ 1 ▁ to ▁ " << n << " are ▁ : " << endl ; for ( int i = 2 ; i <= n - 6 ; ++ i ) {