Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with primes
Search options not deleted
user 178022
Primes or prime numbers are numbers which are divisible only by themselves and one, starting with 2, 3, 5, 7, 11.... They are commonly used in encryption and hashing algorithms.
7
votes
2
answers
4k
views
alternating Fibonacci and prime series
#include <bits/stdc++.h>
using namespace std;
int retPrime(int n)
{
//Using sieve of Eratosthenes to generate primes
int size = n + 1;
bool Primes[100];
int count = 0;
memset(Primes … , true, sizeof(Primes));
for (int i = 2; i<sqrt(100); ++i)
{
if (Primes[i] == true)
{
for (int j = i * 2; j <= 100; j = j + i)
{
Primes[j …
- 237