#projecteuler — Public Fediverse posts
Live and recent posts from across the Fediverse tagged #projecteuler, aggregated by home.social.
-
Was going to do Stuff today but we started doing #ProjectEuler with @Daffodil and I had to redo all my old solutions. Got up to 11.
Still ashamed that my fancy segmented sieve didn't work for the 10001sth prime. :moomin_sad:Can't sleep, my solution for problem 11 doesn't work. I've solved this 10 years ago already, why can't I solve it now with a BSc in my bag. :neofox_scream:
-
Was going to do Stuff today but we started doing #ProjectEuler with @Daffodil and I had to redo all my old solutions. Got up to 11.
Still ashamed that my fancy segmented sieve didn't work for the 10001sth prime. :moomin_sad:Can't sleep, my solution for problem 11 doesn't work. I've solved this 10 years ago already, why can't I solve it now with a BSc in my bag. :neofox_scream:
-
Was going to do Stuff today but we started doing #ProjectEuler with @Daffodil and I had to redo all my old solutions. Got up to 11.
Still ashamed that my fancy segmented sieve didn't work for the 10001sth prime. :moomin_sad:Can't sleep, my solution for problem 11 doesn't work. I've solved this 10 years ago already, why can't I solve it now with a BSc in my bag. :neofox_scream:
-
Was going to do Stuff today but we started doing #ProjectEuler with @Daffodil and I had to redo all my old solutions. Got up to 11.
Still ashamed that my fancy segmented sieve didn't work for the 10001sth prime. :moomin_sad:Can't sleep, my solution for problem 11 doesn't work. I've solved this 10 years ago already, why can't I solve it now with a BSc in my bag. :neofox_scream:
-
Was going to do Stuff today but we started doing #ProjectEuler with @Daffodil and I had to redo all my old solutions. Got up to 11.
Still ashamed that my fancy segmented sieve didn't work for the 10001sth prime. :moomin_sad:Can't sleep, my solution for problem 11 doesn't work. I've solved this 10 years ago already, why can't I solve it now with a BSc in my bag. :neofox_scream:
-
I wonder how far I could get with #ProjectEuler on my old #AcornElectron
-
Gemini 3 Pro đã giải thành công một bài toán Project Euler mới nhất, mà GPT 5.1 Extended Thinking không thể hoàn thành. Gemini 3 Pro giải quyết trong chưa đầy 5 phút, trong khi GPT 5.1 bị hết thời gian ở 13 phút. Các AI chỉ được dùng tính năng chạy code nội bộ, không có tìm kiếm Google.
#Gemini3Pro #GPT51 #AI #ProjectEuler #TechNews #TríTuệNhânTạo #CôngNghệ
-
🔢🤓 Ah yes, Project Euler: the ultimate playground for those who find their math curriculum too "basic" but still enjoy the thrill of solving problems that bring back the joys of high school algebra. 🎓 Because what's more fun than mixing math with programming to really spice up your free time? 🖥️
https://projecteuler.net #ProjectEuler #MathProblems #CodingFun #ProblemSolving #LearningThroughPlay #HackerNews #ngated -
🔢🤓 Ah yes, Project Euler: the ultimate playground for those who find their math curriculum too "basic" but still enjoy the thrill of solving problems that bring back the joys of high school algebra. 🎓 Because what's more fun than mixing math with programming to really spice up your free time? 🖥️
https://projecteuler.net #ProjectEuler #MathProblems #CodingFun #ProblemSolving #LearningThroughPlay #HackerNews #ngated -
🔢🤓 Ah yes, Project Euler: the ultimate playground for those who find their math curriculum too "basic" but still enjoy the thrill of solving problems that bring back the joys of high school algebra. 🎓 Because what's more fun than mixing math with programming to really spice up your free time? 🖥️
https://projecteuler.net #ProjectEuler #MathProblems #CodingFun #ProblemSolving #LearningThroughPlay #HackerNews #ngated -
🔢🤓 Ah yes, Project Euler: the ultimate playground for those who find their math curriculum too "basic" but still enjoy the thrill of solving problems that bring back the joys of high school algebra. 🎓 Because what's more fun than mixing math with programming to really spice up your free time? 🖥️
https://projecteuler.net #ProjectEuler #MathProblems #CodingFun #ProblemSolving #LearningThroughPlay #HackerNews #ngated -
Ich liebe #ProjectEuler:
1. Aufgabe verstehen
2. Naive Lösung ausprobieren
3. Verzweifeln
4. Neue Muster erkennen
5. Sich unbesiegbar fühlen
6. Nächste Aufgabe -
Ich liebe #ProjectEuler:
1. Aufgabe verstehen
2. Naive Lösung ausprobieren
3. Verzweifeln
4. Neue Muster erkennen
5. Sich unbesiegbar fühlen
6. Nächste Aufgabe -
Ich liebe #ProjectEuler:
1. Aufgabe verstehen
2. Naive Lösung ausprobieren
3. Verzweifeln
4. Neue Muster erkennen
5. Sich unbesiegbar fühlen
6. Nächste Aufgabe -
Ich liebe #ProjectEuler:
1. Aufgabe verstehen
2. Naive Lösung ausprobieren
3. Verzweifeln
4. Neue Muster erkennen
5. Sich unbesiegbar fühlen
6. Nächste Aufgabe -
Ich liebe #ProjectEuler:
1. Aufgabe verstehen
2. Naive Lösung ausprobieren
3. Verzweifeln
4. Neue Muster erkennen
5. Sich unbesiegbar fühlen
6. Nächste Aufgabe -
If I don't trigger systemd-oomd at least once while working on a #ProjectEuler problem, am I even trying?
-
If I don't trigger systemd-oomd at least once while working on a #ProjectEuler problem, am I even trying?
-
If I don't trigger systemd-oomd at least once while working on a #ProjectEuler problem, am I even trying?
-
If I don't trigger systemd-oomd at least once while working on a #ProjectEuler problem, am I even trying?
-
If I don't trigger systemd-oomd at least once while working on a #ProjectEuler problem, am I even trying?
-
Yeay, selama tiga hari berturut-turut, saya bisa menyelesaikan tiga soal #ProjectEuler. Dan di halaman-halamn diskusi terkait cara menyelesaikan masalah ketiga soal itu, wow... saya melihat kode-kode paling brutal (nama-nama variabel cuma satu huruf; butuh waktu untuk memahami maksud _setiap_ barisnya), tapi juga paling efisien (hanya butuh (seper-)sekian detik untuk mendapatkan jawaban).
o7 (hormat).
orz (sujud). -
Yeay, selama tiga hari berturut-turut, saya bisa menyelesaikan tiga soal #ProjectEuler. Dan di halaman-halamn diskusi terkait cara menyelesaikan masalah ketiga soal itu, wow... saya melihat kode-kode paling brutal (nama-nama variabel cuma satu huruf; butuh waktu untuk memahami maksud _setiap_ barisnya), tapi juga paling efisien (hanya butuh (seper-)sekian detik untuk mendapatkan jawaban).
o7 (hormat).
orz (sujud). -
I upload other video today
https://video.hardlimit.com/w/86T4wkWgMqmGY4YB5PcoBU
now introduce myself with #projectEuler platform, basically I resolved a simple problem just for know the platform. -
I upload other video today
https://video.hardlimit.com/w/86T4wkWgMqmGY4YB5PcoBU
now introduce myself with #projectEuler platform, basically I resolved a simple problem just for know the platform. -
I upload other video today
https://video.hardlimit.com/w/86T4wkWgMqmGY4YB5PcoBU
now introduce myself with #projectEuler platform, basically I resolved a simple problem just for know the platform. -
I upload other video today
https://video.hardlimit.com/w/86T4wkWgMqmGY4YB5PcoBU
now introduce myself with #projectEuler platform, basically I resolved a simple problem just for know the platform. -
I upload other video today
https://video.hardlimit.com/w/86T4wkWgMqmGY4YB5PcoBU
now introduce myself with #projectEuler platform, basically I resolved a simple problem just for know the platform. -
A little bit of playing around in #Go with some of the #ProjectEuler problems I'd not done before... and I quite like it. Certainly seems easier to get my head around than #rust
Note: I'm not looking to start a Go vs Rust debate... just that I've played a little with both and have found Go easier to work with for the things I've tried.
-
🧑💻 Write a script to “Find the sum of all the multiples of 3 or 5 below 1000” in O(1), i.e. constant time.
The solution is simple and elegant, try it out.This problem is from #ProjectEuler.
#coding #math #python #haskell -
🧑💻 Write a script to “Find the sum of all the multiples of 3 or 5 below 1000” in O(1), i.e. constant time.
The solution is simple and elegant, try it out.This problem is from #ProjectEuler.
#coding #math #python #haskell -
🧑💻 Write a script to “Find the sum of all the multiples of 3 or 5 below 1000” in O(1), i.e. constant time.
The solution is simple and elegant, try it out.This problem is from #ProjectEuler.
#coding #math #python #haskell -
🧑💻 Write a script to “Find the sum of all the multiples of 3 or 5 below 1000” in O(1), i.e. constant time.
The solution is simple and elegant, try it out.This problem is from #ProjectEuler.
#coding #math #python #haskell -
🧑💻 Write a script to “Find the sum of all the multiples of 3 or 5 below 1000” in O(1), i.e. constant time.
The solution is simple and elegant, try it out.This problem is from #ProjectEuler.
#coding #math #python #haskell -
-
-
-
-
-
A few years ago, I had solved a lot of Project Euler problems #ProjectEuler problems in #Python. I even had a lot of very useful utility functions to make things more modular and easier.
After seriously starting to learn #Haskell sometime last year, I've been slowly translating that old code. I translated the utility functions as a way to learn the new language. I made a lot of progress this week on the problems themselves and I've realized how much better it is in Haskell.
Of course, a part of it is that I've changed as a programmer, but the old Python code looks ugly compared to what I'm now writing in Haskell. The functional paradigm with lazy evaluation seems to fit perfectly with the kind of problems on Project Euler.
My only "complaint" is that memoization is harder in Haskell. However, that's because I haven't spent any time figuring out how to do that well. It is not a language issue, but a me issue.
I've definitely decided that I'll be finishing my "solve substantial problems on Project Euler" goal in Haskell and not use Python for that anymore.
-
A few years ago, I had solved a lot of Project Euler problems #ProjectEuler problems in #Python. I even had a lot of very useful utility functions to make things more modular and easier.
After seriously starting to learn #Haskell sometime last year, I've been slowly translating that old code. I translated the utility functions as a way to learn the new language. I made a lot of progress this week on the problems themselves and I've realized how much better it is in Haskell.
Of course, a part of it is that I've changed as a programmer, but the old Python code looks ugly compared to what I'm now writing in Haskell. The functional paradigm with lazy evaluation seems to fit perfectly with the kind of problems on Project Euler.
My only "complaint" is that memoization is harder in Haskell. However, that's because I haven't spent any time figuring out how to do that well. It is not a language issue, but a me issue.
I've definitely decided that I'll be finishing my "solve substantial problems on Project Euler" goal in Haskell and not use Python for that anymore.
-
A few years ago, I had solved a lot of Project Euler problems #ProjectEuler problems in #Python. I even had a lot of very useful utility functions to make things more modular and easier.
After seriously starting to learn #Haskell sometime last year, I've been slowly translating that old code. I translated the utility functions as a way to learn the new language. I made a lot of progress this week on the problems themselves and I've realized how much better it is in Haskell.
Of course, a part of it is that I've changed as a programmer, but the old Python code looks ugly compared to what I'm now writing in Haskell. The functional paradigm with lazy evaluation seems to fit perfectly with the kind of problems on Project Euler.
My only "complaint" is that memoization is harder in Haskell. However, that's because I haven't spent any time figuring out how to do that well. It is not a language issue, but a me issue.
I've definitely decided that I'll be finishing my "solve substantial problems on Project Euler" goal in Haskell and not use Python for that anymore.
-
A few years ago, I had solved a lot of Project Euler problems #ProjectEuler problems in #Python. I even had a lot of very useful utility functions to make things more modular and easier.
After seriously starting to learn #Haskell sometime last year, I've been slowly translating that old code. I translated the utility functions as a way to learn the new language. I made a lot of progress this week on the problems themselves and I've realized how much better it is in Haskell.
Of course, a part of it is that I've changed as a programmer, but the old Python code looks ugly compared to what I'm now writing in Haskell. The functional paradigm with lazy evaluation seems to fit perfectly with the kind of problems on Project Euler.
My only "complaint" is that memoization is harder in Haskell. However, that's because I haven't spent any time figuring out how to do that well. It is not a language issue, but a me issue.
I've definitely decided that I'll be finishing my "solve substantial problems on Project Euler" goal in Haskell and not use Python for that anymore.
-
A few years ago, I had solved a lot of Project Euler problems #ProjectEuler problems in #Python. I even had a lot of very useful utility functions to make things more modular and easier.
After seriously starting to learn #Haskell sometime last year, I've been slowly translating that old code. I translated the utility functions as a way to learn the new language. I made a lot of progress this week on the problems themselves and I've realized how much better it is in Haskell.
Of course, a part of it is that I've changed as a programmer, but the old Python code looks ugly compared to what I'm now writing in Haskell. The functional paradigm with lazy evaluation seems to fit perfectly with the kind of problems on Project Euler.
My only "complaint" is that memoization is harder in Haskell. However, that's because I haven't spent any time figuring out how to do that well. It is not a language issue, but a me issue.
I've definitely decided that I'll be finishing my "solve substantial problems on Project Euler" goal in Haskell and not use Python for that anymore.
-
I just did 2*3*4*5*6**7*8*9*10 to see the result like a moron
I am sutdying #projectEuler on rust, *please* do not send spoilers or suggestions
