Create accountLogin

Recent searches

No recent searches

Search options

Only available when logged in.
mastodon.ie is one of the many independent Mastodon servers you can use to participate in the fediverse.
Irish Mastodon - run from Ireland, we welcome all who respect the community rules and members.

Administered by:

Server stats:

1.6K
active users

mastodon.ie: AboutProfiles directoryPrivacy policy

Mastodon: AboutGet the appKeyboard shortcutsView source codev4.3.9

#projecteuler

0 posts0 participants0 posts today
Matthew Slowe<p>I'm really liking <a href="https://infosec.exchange/tags/GoLang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>GoLang</span></a>... done <a href="https://infosec.exchange/tags/ProjectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a> problem 24, got the answer on first attempt and it ran in less than 2 seconds which is not too shabby!</p><pre><code>Initialised perms as [0 1 2 3 4 5 6 7 8 9]<br>Permuted to 3628800 items<br>Collapsed to 3628800 ints<br>Sorted<br>The millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9 is: &lt;redacted&gt;<br><br>real 0m1.370s<br>user 0m1.561s<br>sys 0m0.404s<br><br></code></pre><p><a href="https://projecteuler.net/problem=24" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">projecteuler.net/problem=24</span><span class="invisible"></span></a></p>
Matthew Slowe<p>A little bit of playing around in <a href="https://infosec.exchange/tags/Go" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Go</span></a> with some of the <a href="https://infosec.exchange/tags/ProjectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a> problems I'd not done before... and I quite like it. Certainly seems easier to get my head around than <a href="https://infosec.exchange/tags/rust" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>rust</span></a> </p><p>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.</p><p><a href="https://infosec.exchange/tags/GoLang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>GoLang</span></a> <a href="https://infosec.exchange/tags/RustLang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>RustLang</span></a></p>
Raymond<p>Project Euler seems to be easy this week. A simple probability calculation for a deck of cards.</p><p>If you want the site's award for getting the latest puzzle, it can be done now. There's also another relatively easy one in the latest ten problems.</p><p><a href="https://projecteuler.net/problem=938" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">projecteuler.net/problem=938</span><span class="invisible"></span></a></p><p><a href="https://ottawa.place/tags/ProjectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a> <a href="https://ottawa.place/tags/mathPuzzles" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>mathPuzzles</span></a></p>
Musned<p>🧑‍💻 Write a script to “Find the sum of all the multiples of 3 or 5 below 1000” in O(1), i.e. constant time.<br>The solution is simple and elegant, try it out.</p><p>This problem is from <a href="https://mastodon.online/tags/ProjectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a>. <br><a href="https://mastodon.online/tags/coding" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>coding</span></a> <a href="https://mastodon.online/tags/math" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>math</span></a> <a href="https://mastodon.online/tags/python" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>python</span></a> <a href="https://mastodon.online/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a></p>
Graciano é entusiasta do ócio<p>I just did 2*3*4*5*6**7*8*9*10 to see the result like a moron</p><p>I am sutdying <a href="https://burnthis.town/tags/projectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projectEuler</span></a> on rust, *please* do not send spoilers or suggestions</p>
Tim Riemann<p>Ich überlege ja, ob ich dieses Jahr wieder beim <a href="https://mastodon.social/tags/AdventOfCode" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>AdventOfCode</span></a> teilnehme oder ob ich stattdessen lieber mal wieder ein paar Probleme beim <a href="https://mastodon.social/tags/ProjectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a> löse. An letzterem habe ich 2013 zum letzten Mal gearbeitet. Muss mal schauen, ob da irgendwo der Quellcode noch herumfliegt. Mein Fortschritt ist jedenfalls noch da 🙂. <a href="https://projecteuler.net" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">projecteuler.net</span><span class="invisible"></span></a></p>
Alessandro<p>considerata "l'amicizia" di <a href="https://livellosegreto.it/tags/crystallang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>crystallang</span></a> e <a href="https://livellosegreto.it/tags/ruby" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ruby</span></a> sto aggiungendo anche qualche scriptino in Ruby appunto.</p><p><a href="https://livellosegreto.it/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a></p>
Alessandro<p>Aggiornamento <a href="https://livellosegreto.it/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a> </p><p>Visto che siamo in 16(😢) a giocare con <a href="https://livellosegreto.it/tags/crystallang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>crystallang</span></a>, alla fine ho pensato di raccogliere le soluzioni in un repo su framagit!<br>Non che le mie soluzioni siano particolarmente originali ed esemplari ma, magari possono essere utili, chissà! Condividere inoltre potrebbe aiutarmi a trovare la spinta per andare avanti senza mollare subito 😂</p><p>Qualche soluzione è anche in C (volevo vedere se ricordavo qualcosina dopo molti anni 😅)</p><p><a href="https://framagit.org/alephoto85/project-euler" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">framagit.org/alephoto85/projec</span><span class="invisible">t-euler</span></a></p><p><a href="https://livellosegreto.it/tags/programmazione" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programmazione</span></a></p>
jeeger<p>Doing <a href="https://mastodon.social/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a> with <a href="https://mastodon.social/tags/clojure" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>clojure</span></a> has left me with an inability to write non-tailrecursive code.</p>
jeeger<p>Back on my Bullshit (<a href="https://mastodon.social/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a>).</p>
Hongyu Yang<p>It's not a hard question per se but seeing I am one of the 3369 people who managed to solve this question still makes me feel proud of myself🥹</p><p>(From tomorrow on I'll work in my school library on my webinar project rather than solving algorithm questions in a coffeeshop🥺)</p><p><a href="https://mastodon.social/tags/algorithm" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>algorithm</span></a> <a href="https://mastodon.social/tags/mathematics" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>mathematics</span></a> <a href="https://mastodon.social/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a></p>
Hongyu Yang<p>Hey uhhh I'm sorry I'm procrastinating again today but let's go over how I approached this question.<br><a href="https://mastodon.social/tags/math" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>math</span></a> <a href="https://mastodon.social/tags/algorithm" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>algorithm</span></a> <a href="https://mastodon.social/tags/optimization" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>optimization</span></a> <a href="https://mastodon.social/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a></p>
Hongyu Yang<p>Ok I promise I won't be procrastinating by solving Project Euler from tomorrow on🥺</p><p><a href="https://mastodon.social/tags/math" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>math</span></a> <a href="https://mastodon.social/tags/algorithm" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>algorithm</span></a> <a href="https://mastodon.social/tags/programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programming</span></a> <a href="https://mastodon.social/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a></p>
Hongyu Yang<p>My rank has improved to top 5000, yeah!</p><p><a href="https://mastodon.social/tags/math" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>math</span></a> <a href="https://mastodon.social/tags/algorithm" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>algorithm</span></a> <a href="https://mastodon.social/tags/hackerrank" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>hackerrank</span></a> <a href="https://mastodon.social/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a></p>
Hongyu Yang<p>Seriously, the test data must be absolutely crazy and here's the best algorithm I come up with this question (still only passing 2 out of 11)<br>The journey, however, is again a fascinating one. Let me briefly recap:</p><p><a href="https://mastodon.social/tags/math" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>math</span></a> <a href="https://mastodon.social/tags/algorithm" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>algorithm</span></a> <a href="https://mastodon.social/tags/problemsolving" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>problemsolving</span></a> <a href="https://mastodon.social/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a></p>
Hongyu Yang<p>Figured out a rudimentary strategy of solving this question and manually found the answers for 4,5,6 on paper. First of all, given the total N digits there are only a couple of possible combinations of A, B, C's (A*B=C) digits such that they add up to N.</p><p>1/3<br><a href="https://mastodon.social/tags/math" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>math</span></a> <a href="https://mastodon.social/tags/algorithm" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>algorithm</span></a> <a href="https://mastodon.social/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a></p>
Bruno Rohée<p>Made my solution to <a href="https://pouet.chapril.org/tags/ProjectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a> problem #15 basically instantaneous <a href="https://projecteuler.net/problem=15" rel="nofollow noopener noreferrer" target="_blank"><span class="invisible">https://</span><span class="">projecteuler.net/problem=15</span><span class="invisible"></span></a></p>
nicegnome<p>Finished the first 55 <a href="https://home.social/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a> problems in <a href="https://home.social/tags/python" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>python</span></a>.</p><p>Now to decide whether to keep going in Python or start over with another language. Or try to quit the addiction altogether.</p>
Aaron Toponce ⚛️:debian:<p>The work shift is done, now I want to get back to solving <a href="https://fosstodon.org/tags/ProjectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a> challenges, but their server down with "503 Service Unavailable".</p>
Jonathan LamotheWhy am I just learning about <a href="https://social.jlamothe.net/search?tag=AdventOfCode" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>AdventOfCode</span></a> now? Kind of reminds me of <a href="https://social.jlamothe.net/search?tag=ProjectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a>.
ExploreLive feeds
About