OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

file rename to standards

Browse Source
This commit is contained in:
Krishna Vedala 2020-05-25 22:13:39 -04:00
parent 0e3a57ab3f
commit 412d3ff1a2
No known key found for this signature in database
GPG Key ID: BA19ACF8FC8792F7
1 changed files with 3 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
math/primes_up_to_10^8.cpp → math/primes_up_to_billion.cpp
View File

@ -1,12 +1,12 @@
#include<iostream>
#include <cstring> #include <cstring>
#include <iostream>
char prime[100000000]; char prime[100000000];
void Sieve(int64_t n) { void Sieve(int64_t n) {
memset(prime, '1', sizeof(prime)); // intitize '1' to every index memset(prime, '1', sizeof(prime)); // intitize '1' to every index
prime[0] = '0'; // 0 is not prime prime[0] = '0'; // 0 is not prime
prime[1] = '0'; // 1 is not prime prime[1] = '0'; // 1 is not prime
for (int p = 2; p * p <= n; p++) { for (int p = 2; p * p <= n; p++) {
if (prime[p] == '1') { if (prime[p] == '1') {
for (int i = p * p; i <= n; i += p) for (int i = p * p; i <= n; i += p)
@ -15,7 +15,6 @@ void Sieve(int64_t n) {
} }
} }
int main() { int main() {
Sieve(100000000); Sieve(100000000);
int64_t n; int64_t n;