ProjectEuler100

@ProjectEuler100

Home of the challenge. We're a community working through the first 100 Project Euler challenges together on

Basel, Switzerland
Vrijeme pridruživanja: siječanj 2020.

Tweetovi

Blokirali ste korisnika/cu @ProjectEuler100

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

  1. proslijedio/la je Tweet
    prije 1 sat
    Poništi
  2. proslijedio/la je Tweet
    prije 4 sata

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

    Poništi
  3. proslijedio/la je Tweet
    prije 7 sati
    Poništi
  4. proslijedio/la je Tweet
    prije 9 sati

    Day: 30/100 Did another two problems of Project Euler (33 and 34)!

    Poništi
  5. proslijedio/la je Tweet
    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
  6. proslijedio/la je Tweet

    Beethoven's Silence - (Extended) via I have found this to be most sublime melody for long-term coding...

    Poništi
  7. proslijedio/la je Tweet
    prije 14 sati

    Plans for next week: SVG, animation, and of course, plenty more JavaScript 👌 Hopefully with seven more steps toward 🤞

    Prikaži ovu nit
    Poništi
  8. proslijedio/la je Tweet
    prije 14 sati
    Odgovor korisniku/ci

    Wow, that's quite a jump 👏 It's going to take me a while, but I hope to catch up with you soon👍 Perhaps even a while loop 😅

    Poništi
  9. proslijedio/la je Tweet
    prije 18 sati

    Kept generating primes and caching them, so that recomputation can be avoided Code :

    Poništi
  10. proslijedio/la je Tweet
    prije 21 sat

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

    Poništi
  11. proslijedio/la je Tweet
    prije 24 sata

    My Day 2 update - I solved 6 yesterday. I solved 2 problems - 7 & 8 today. Problem 7 was good to find nth Prime.

    Poništi
  12. proslijedio/la je Tweet
    2. velj

    Problem 47 - ✅ did a brute force, but still pretty fast.

    Poništi
  13. proslijedio/la je Tweet
    2. velj

    has me learning about integer partitions right now, sharp increment in difficulty and amount of research per problem after the 60 problem mark

    Prikaži ovu nit
    Poništi
  14. proslijedio/la je Tweet
    2. velj

    Day: 29/100 Did another Project Euler problem and finished another section of the Web Development course!

    Poništi
  15. proslijedio/la je Tweet
    2. velj

    Solution to problem 38 ran for the longest time (~30 seconds) compared any of my previous solutions. As long as it satisfies the "one-minute rule" :P Link:

    Poništi
  16. proslijedio/la je Tweet
    2. velj

    Problem 21 of solved. Lua solves in 1.2s, Swift an _order of magnitude_ slower at 22.7s. I could probably spend more time making my divisors method faster, but I’m ready to move on. I spent way too long misunderstanding this problem.

    Prikaži ovu nit
    Poništi
  17. proslijedio/la je Tweet
    2. velj
    Poništi
  18. proslijedio/la je Tweet
    2. velj
    Odgovor korisniku/ci

    You are quite on a roll, congrats 👏 Hope to keep up with your consistency 👌

    Poništi
  19. proslijedio/la je Tweet
    2. velj

    Completed problem #26 🙌 This one took a while to explain, but at least I have a function to compute long divisions now 🤓👌

    Poništi
  20. proslijedio/la je Tweet
    1. velj

    R2D35 prob 42 done for learning about minimum spanning tree, getting familiar with library for graph, in prep of 2019 qualification problem

    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:

    ·