Twitter | Pretraživanje | |
Anjan Roy
I know nothing!!!
464
Tweetovi
852
Pratim
169
Osobe koje vas prate
Tweetovi
Anjan Roy 3. velj
Completed problem 48 of , was pretty straightforward with help of "math/big" package
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 3. velj
Solved problem 47 of , used prime caching & unique prime factor caching of numbers, to avoid huge recomputation, completed in ~2.83s 🥳
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 2. velj
Kept generating primes and caching them, so that recomputation can be avoided Code :
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 2. velj
Solved problem 46 of , used prime caching to avoid huge recomputation of primes, done in ~7.99ms 😎
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 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
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 1. velj
Solved problem 44 of , obtained first instance of pentagonal number pair in ~7.28s
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 1. velj
Completed prob 43 of , used lexicographic generation algo, checked only 0-9 pandigital numbers, reduced # of checks drastically, completed in ~1.26s 😎🥳
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 31. sij
Odgovor korisniku/ci @GavMcGuigan
Great work 👍
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 31. sij
Solved problem 42 of , leveraged power of 's concurrency support , took ~2.5ms 😊
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 30. sij
Solved problem 41 of , used goroutines for better performance, but had to check for upto 9-digit pandigital primes, took ~2.33m 😕
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 30. sij
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 30. sij
Solved problem 40 of , done with constant space complexity, stored 5 digits at max 🥳
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 30. sij
Odgovor korisniku/ci @Alexand39166657
All the best
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 29. sij
Solved problem 39 of , goroutines reduced time requirement to half , now works in ~5.58s
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 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
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 29. sij
Odgovor korisniku/ci @JulioSotodev
Yeah, no doubt very easy. Binomial coefficient determination using Pascal triangle is computationaly less hard .
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 28. sij
Odgovor korisniku/ci @JulioSotodev
Nice approach, but calculating binomial coefficient in language other than python, using this approach, may be painful !!! 👍
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 28. sij
Solved problem 37 of , was pretty easy 😎 , found solution within ~500ms, on a low spec machine
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 28. sij
Solved problem 36 of , was pretty straightforward and easy to understand 🥳
Reply Retweet Označi sa "sviđa mi se"
Anjan Roy 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 ?
Reply Retweet Označi sa "sviđa mi se"