Tweetovi

Blokirali ste korisnika/cu @meanjanry

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @meanjanry

  1. prije 4 sata

    Completed problem 48 of , was pretty straightforward with help of "math/big" package

    Poništi
  2. prije 9 sati

    Solved problem 47 of , used prime caching & unique prime factor caching of numbers, to avoid huge recomputation, completed in ~2.83s 🥳

    Poništi
  3. prije 21 sat

    Solved problem 46 of , used prime caching to avoid huge recomputation of primes, done in ~7.99ms 😎

    Poništi
  4. 1. velj

    And completed problem 45 of , was pretty straightforward, just kept generating triangular numbers from 286-th pos & kept checking for pentagonal & hexagonal property, until we get one, which satisfies both

    Poništi
  5. 1. velj

    Solved problem 44 of , obtained first instance of pentagonal number pair in ~7.28s

    Poništi
  6. 1. velj

    Completed prob 43 of , used lexicographic generation algo, checked only 0-9 pandigital numbers, reduced # of checks drastically, completed in ~1.26s 😎🥳

    Poništi
  7. 31. sij

    Solved problem 42 of , leveraged power of 's concurrency support , took ~2.5ms 😊

    Poništi
  8. 30. sij

    Solved problem 41 of , used goroutines for better performance, but had to check for upto 9-digit pandigital primes, took ~2.33m 😕

    Poništi
  9. 30. sij
    Poništi
  10. 30. sij

    Solved problem 40 of , done with constant space complexity, stored 5 digits at max 🥳

    Poništi
  11. 29. sij

    Solved problem 39 of , goroutines reduced time requirement to half , now works in ~5.58s

    Poništi
  12. 29. sij

    Solved problem 38 of , avoided unnecessary computation by only checking those concatenated numbers having exactly 9 digits, otherwise we skip 😎, done with in ~10ms on low spec machine

    Poništi
  13. 28. sij

    Solved problem 37 of , was pretty easy 😎 , found solution within ~500ms, on a low spec machine

    Poništi
  14. 28. sij

    Solved problem 36 of , was pretty straightforward and easy to understand 🥳

    Poništi
  15. 27. sij

    Solved problem 35 of , used prime buffering to avoid recomputation of circular primes , took ~1.2568s on a low spec machine, need to improve it 😕, how long did it take yours ?

    Poništi
  16. 27. sij

    Solved problem 34 of , was unable to understand what might be upper limit, discovered 40225 is max number, satisfying given criteria 😎

    Poništi
  17. 27. sij
    Poništi
  18. 26. sij

    Solved problem { 31, 32 } of , used dynamic programming for 31, recursion was 💻-ly heavy 😑. Wrote pandigital comb checker for 32, reduced number of checks, used only those combs, if total digit count == 9

    Poništi
  19. 24. sij

    Solved problem 30 of , was pretty straightforward

    Poništi
  20. 24. sij
    Poništi

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

    Možda bi vam se svidjelo i ovo:

    ·