backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-04 02:59:43 +08:00
Code Issues Projects Releases Wiki Activity

fix: integer overflow due to multiplication fixed (#886)

Browse Source 
* formatting source-code for 72c365dcd3

* Fixed Bug [munmap_chunck() core dumped]

* formatting source-code for b06bbf4dc6

* fixed line spacing

* fixed line spacing

* fixed documentation

* closed the paranthesis of line 3

* formatting source-code for 8233eda889

* Bug Fix heap sort [Fresh Implementation]

* formatting source-code for e464ddac36

* Bug Fix heap sort [Fresh Implementation]

* formatting source-code for 803981c831

* switched to normal functions from lambda

* formatting source-code for ced5dcd6c4

* Added template and test cases

* formatting source-code for 7c8617fa46

* fixed docs

* fixed line spacing in tests

* fix docs

* Multiplication result may overflow 'int' before it is converted to 'long'.

* fixed cpplint long -> int64

* fixed compiler error

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Ayaan Khan
2020-06-23 23:50:45 +05:30
committed by GitHub
parent 445f6722d8
commit 2aec4efdd3
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
math/primes_up_to_billion.cpp
View File

@@ -14,9 +14,9 @@ void Sieve(int64_t n) {
memset(prime, '1', sizeof(prime)); // intitize '1' to every index
prime[0] = '0'; // 0 is not prime
prime[1] = '0'; // 1 is not prime
for (int p = 2; p * p <= n; p++) {
for (int64_t p = 2; p * p <= n; p++) {
if (prime[p] == '1') {
for (int i = p * p; i <= n; i += p)
for (int64_t i = p * p; i <= n; i += p)
prime[i] = '0'; // set all multiples of p to false
}
}