Medijski sadržaj
- Tweetovi
- Tweetovi i odgovori
- Medijski sadržaj, trenutna stranica.
-
Completed problem 48 of
#ProjectEuler100 , was pretty straightforward with help of "math/big" package@ProjectEuler100#golangpic.twitter.com/gWJylKAq1b
-
Solved problem 47 of
#ProjectEuler100 , used prime caching & unique prime factor caching of numbers, to avoid huge recomputation, completed in ~2.83s
@ProjectEuler100pic.twitter.com/XxzEcwJXKQ
-
Solved problem 46 of
#ProjectEuler100 , used prime caching to avoid huge recomputation of primes, done in ~7.99ms
@ProjectEuler100#golangpic.twitter.com/HL6iPBVQJA
-
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@ProjectEuler100pic.twitter.com/q0Y8npKKjl
-
Solved problem 44 of
#ProjectEuler100 , obtained first instance of pentagonal number pair in ~7.28s@ProjectEuler100#golangpic.twitter.com/6ttHB2gtbu
-
Completed prob 43 of
#ProjectEuler100 , used lexicographic generation algo, checked only 0-9 pandigital numbers, reduced # of checks drastically, completed in ~1.26s
@ProjectEuler100#golangpic.twitter.com/rw6IkBCNqE
-
Solved problem 42 of
#ProjectEuler100 , leveraged power of#golang 's concurrency support , took ~2.5ms
@ProjectEuler100pic.twitter.com/zQ7Ov6AdIC
-
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
-
Solved problem 40 of
#ProjectEuler100 , done with constant space complexity, stored 5 digits at max
@ProjectEuler100#Golangpic.twitter.com/s9XdEv63oX
-
Solved problem 39 of
#ProjectEuler100 , goroutines reduced time requirement to half , now works in ~5.58s@ProjectEuler100#Golangpic.twitter.com/i9V89uLoZg
-
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#golangpic.twitter.com/ss3BfTHM27
-
Solved problem 37 of
#ProjectEuler100 , was pretty easy
, found solution within ~500ms, on a low spec machine
@ProjectEuler100pic.twitter.com/XAZKXJN4eR
-
Solved problem 36 of
#ProjectEuler100 , was pretty straightforward and easy to understand
@ProjectEuler100#Golangpic.twitter.com/CAk5ydftiY
-
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 ?
@ProjectEuler100pic.twitter.com/5dUakOQqoD
-
Solved problem 34 of
#projecteuler , was unable to understand what might be upper limit, discovered 40225 is max number, satisfying given criteria
#ProjectEuler100@ProjectEuler100#Golangpic.twitter.com/GiBuHxQZqp
-
Solved problem 33 of
#projecteuler , though first misinterpreted it#ProjectEuler100@ProjectEuler100#golang Code : https://github.com/itzmeanjan/project-euler …pic.twitter.com/HoMu5KDqqD
-
Solved problem { 31, 32 } of
#ProjectEuler100 , 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 @ProjectEuler100pic.twitter.com/TQmpk5RR6B
-
Solved problem 30 of
#projecteuler , was pretty straightforward#ProjectEuler100@ProjectEuler100pic.twitter.com/voPvk4yebY
-
Solved problem 29 of
#projecteuler , was pretty easy@ProjectEuler100#ProjectEuler100pic.twitter.com/E2uxfEHoMC
-
Solved problem 28 of
#projecteuler#ProjectEuler100@ProjectEuler100#golangpic.twitter.com/NkMh08uhZr
Č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.