nortega/indivisible-legacy
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Made a fix, because previously it was not measuring primes.

Browse Source
This commit is contained in:
Nicolás A. Ortega Froysa
2016-12-13 16:32:10 +01:00
parent 3110c74174
commit 5aa0b333c0
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/main.c
View File

@@ -43,8 +43,8 @@ int main(void) {
// Calculate half of `num' // Calculate half of `num'
mpz_fdiv_q_ui(halfNum, num, 2); mpz_fdiv_q_ui(halfNum, num, 2);
// Loop through found primes // Loop through found primes
// Skip 2 because we're skipping even nymbers for(ulli i = 0; i < primes.end; ++i) {
for(ulli i = 1; mpz_cmp(primes.list[i], halfNum) >= 0; ++i) { if(mpz_cmp(primes.list[i], halfNum) >= 0) break;
// If `num' is divisible by a prime then go to the next number // If `num' is divisible by a prime then go to the next number
if(mpz_divisible_p(num, primes.list[i]) != 0) if(mpz_divisible_p(num, primes.list[i]) != 0)
goto nextPrime; goto nextPrime;