From 8d11c6c8213f46f0fa19826917c255edd5d43cb1 Mon Sep 17 00:00:00 2001 From: mzuenni Date: Sun, 28 Jul 2024 22:54:40 +0200 Subject: Test (#4) * update * moved content in subdir * rename file * add test setup * add test setup * add github action * automaticly test all cpp files * timeout after 10s * setulimit and dont zero memory * test build pdf * install latexmk * update * update * ngerman * fonts * removed old code * add first test * added tests * test in sorted order * more tests * simplified test * more tests * fix suffix tree * fixes and improvements * done ust lst directly * fix swap * add links to pdf * fix constants * add primorial * add comment * various improvements * more tests * added missing stuf * more tests * fix tests * more tests * more tests * more tests * fix recursion? * test trie * more tests * only use python temporarily for listings * only use python temporarily for listings * more tests * fix longestCommonSubstring * more tests * more tests * made code more similiar * fix? * more tests * more tests * more tests * add ahoCorasick test + limit 4GB stack size * more tests * fix test * add additional test * more tests * more tests * fix? * better fix * fix virtual tree * more tests * more tests * recursive closest pair * more tests * decrease limit * new tests * more tests * fix name * more tests * add test * new test * more tests * more tests * more tests * more tests * new test and content * new code * new code * larger tests * fix and test * new test * new test * update pdf * remove comments * new test * more tests * more testcases * more tests * increased limit * more tests * more tests * more tests * new tests * more tests * shortened code * new test * add basic tests for bigint * more tests * removed old files * new test * ignore some files * more auto more ccw * fix test * more tests * fix * new tests * more tests * more tests * stronger test * actually verify delaunay... * more tests * fix header * more tests * run tests parallel? * test parralel? * add --missing * separate workflows * test * is the pdf checked? * separate workflows * fix workflow * more workflows --------- Co-authored-by: Yidi --- math/linearSieve.cpp | 49 ------------------------------------------------- 1 file changed, 49 deletions(-) delete mode 100644 math/linearSieve.cpp (limited to 'math/linearSieve.cpp') diff --git a/math/linearSieve.cpp b/math/linearSieve.cpp deleted file mode 100644 index b029b9a..0000000 --- a/math/linearSieve.cpp +++ /dev/null @@ -1,49 +0,0 @@ -constexpr ll N = 10'000'000; -ll smallest[N], power[N], sieved[N]; -vector primes; - -//wird aufgerufen mit (p^k, p, k) für prime p -ll mu(ll pk, ll p, ll k) {return -(k == 1);} -ll phi(ll pk, ll p, ll k) {return pk - pk / p;} -ll div(ll pk, ll p, ll k) {return k+1;} -ll divSum(ll pk, ll p, ll k) {return (pk*p+1) / (p - 1);} -ll square(ll pk, ll p, ll k) {return k % 2 ? pk / p : pk;} -ll squareFree(ll pk, ll p, ll k) {return k % 2 ? pk : 1;} - -void sieve() { // O(N) - smallest[1] = power[1] = sieved[1] = 1; - for (ll i = 2; i < N; i++) { - if (smallest[i] == 0) { - primes.push_back(i); - for (ll pk = i, k = 1; pk < N; pk *= i, k++) { - smallest[pk] = i; - power[pk] = pk; - sieved[pk] = mu(pk, i, k); // Aufruf ändern! - }} - for (ll j = 0; i * primes[j] < N && primes[j] < smallest[i]; j++) { - ll k = i * primes[j]; - smallest[k] = power[k] = primes[j]; - sieved[k] = sieved[i] * sieved[primes[j]]; - } - if (i * smallest[i] < N && power[i] != i) { - ll k = i * smallest[i]; - smallest[k] = smallest[i]; - power[k] = power[i] * smallest[i]; - sieved[k] = sieved[power[k]] * sieved[k / power[k]]; -}}} - -ll naive(ll n) { // O(sqrt(n)) - ll res = 1; - for (ll p = 2; p * p <= n; p++) { - if (n % p == 0) { - ll pk = 1; - ll k = 0; - do { - n /= p; - pk *= p; - k++; - } while (n % p == 0); - res *= mu(pk, p, k); // Aufruf ändern! - }} - return res; -} -- cgit v1.2.3