| Tweetovi |
|
Anjan Roy
@meanjanry
|
3. velj |
|
Completed problem 48 of #ProjectEuler100 , was pretty straightforward with help of "math/big" package
@ProjectEuler100 #golang pic.twitter.com/gWJylKAq1b
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
3. velj |
|
Solved problem 47 of #ProjectEuler100 , used prime caching & unique prime factor caching of numbers, to avoid huge recomputation, completed in ~2.83s 🥳
@ProjectEuler100 pic.twitter.com/XxzEcwJXKQ
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
2. velj |
|
Kept generating primes and caching them, so that recomputation can be avoided
Code : itzmeanjan.github.io/project-euler/…
#ProjectEuler100
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
2. velj |
|
Solved problem 46 of #ProjectEuler100 , used prime caching to avoid huge recomputation of primes, done in ~7.99ms 😎
@ProjectEuler100 #golang pic.twitter.com/HL6iPBVQJA
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
1. velj |
|
And completed problem 45 of #ProjectEuler100 , 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 @ProjectEuler100 pic.twitter.com/q0Y8npKKjl
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
1. velj |
|
Solved problem 44 of #ProjectEuler100 , obtained first instance of pentagonal number pair in ~7.28s
@ProjectEuler100 #golang pic.twitter.com/6ttHB2gtbu
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
1. velj |
|
Completed prob 43 of #ProjectEuler100 , used lexicographic generation algo, checked only 0-9 pandigital numbers, reduced # of checks drastically, completed in ~1.26s 😎🥳
@ProjectEuler100 #golang pic.twitter.com/rw6IkBCNqE
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
31. sij |
|
Great work 👍
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
31. sij |
|
Solved problem 42 of #ProjectEuler100 , leveraged power of #golang 's concurrency support , took ~2.5ms 😊
@ProjectEuler100 pic.twitter.com/zQ7Ov6AdIC
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
30. sij |
|
Solved problem 41 of #ProjectEuler100 , used goroutines for better performance, but had to check for upto 9-digit pandigital primes, took ~2.33m 😕 pic.twitter.com/Sb6Boyhquy
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
30. sij |
|
Have started serving #ProjectEuler100 solutions via @github pages at
itzmeanjan.github.io/project-euler/
@ProjectEuler100
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
30. sij |
|
Solved problem 40 of #ProjectEuler100 , done with constant space complexity, stored 5 digits at max 🥳
@ProjectEuler100 #Golang pic.twitter.com/s9XdEv63oX
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
30. sij |
|
All the best
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
29. sij |
|
Solved problem 39 of #ProjectEuler100 , goroutines reduced time requirement to half , now works in ~5.58s
@ProjectEuler100 #Golang pic.twitter.com/i9V89uLoZg
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
29. sij |
|
Solved problem 38 of #ProjectEuler100 , avoided unnecessary computation by only checking those concatenated numbers having exactly 9 digits, otherwise we skip 😎, done with in ~10ms on low spec machine
@ProjectEuler100 #golang pic.twitter.com/ss3BfTHM27
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
29. sij |
|
Yeah, no doubt very easy. Binomial coefficient determination using Pascal triangle is computationaly less hard .
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
28. sij |
|
Nice approach, but calculating binomial coefficient in language other than python, using this approach, may be painful !!! 👍
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
28. sij |
|
Solved problem 37 of #ProjectEuler100 , was pretty easy 😎 , found solution within ~500ms, on a low spec machine
@ProjectEuler100 pic.twitter.com/XAZKXJN4eR
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
28. sij |
|
Solved problem 36 of #ProjectEuler100 , was pretty straightforward and easy to understand 🥳
@ProjectEuler100 #Golang pic.twitter.com/CAk5ydftiY
|
||
|
|
||
|
Anjan Roy
@meanjanry
|
27. sij |
|
Solved problem 35 of #ProjectEuler100 , 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 ?
@ProjectEuler100 pic.twitter.com/5dUakOQqoD
|
||
|
|
||