Project Euler Language Challenge

[...] to attempt something that seemed like a fun idea that had come over lunchtime conversations. Project Euler is fun, but (the early problems, especially if you have done them once before) fairly easy. [...]

[...] With Project Euler being down, I thought it might be difficult to move on and do more recent problems, but then I [...]

[...] Project Euler has been down for a while due to a security breach. However, it is now back up, so soon enough [...]

[...] problem 71 in Processing. Now, Processing is, like ChucK, not a language that was designed for Project Euler, it is a language designed for drawing things and other things that involve graphics. [...]

[...] After using Parrot Assembly and Java Bytecode, I figured I might as well continue my low level / "intermediate representation" [...]

[...] , after solving problem 89 in Parrot Assembly, I claimed that I was interesting in trying out Java Bytecode. So, I did indeed use it. Turns out Java Bytecode is not exactly the world's most user [...]

[...] relatively easily. My use of PASM has inspired me to look into soon using a similar language...Java ByteCode (and, if it is sufficiently different, PIR). Anyway, even if it runs on a VM, it is still [...]

[...] my last final earlier this evening, so I will be free for a while to possibly solve Project Euler problems. I may find other things to pass my time, but nonetheless I expect I will get a good [...]

[...] the previous, as I am now on a two-week long Spring Break, a perfect time to solve some Project Euler problems. Today, I used Forth, which I hadn't used since problem 9, and there I really only used [...]

[...] So, most of my posts on this blog are direct solutions to Project Euler problems. However, this time I am writing on something I did which is kind of meta-Project Euler [...]

[...] have good things to say about but which I have only used in my life for solving the Project Euler problems for this challenge I have used it for. Problem 95 was a pretty fun problem, involving a [...]

[...] are a lot of languages with single letter names. To name just the ones used so far in this language challenge, C,D,J,K,R are all languages, and F# deserves an honorable mention. Even the letters that [...]

[...] Below is the table of my progress on this Language Challenge. The numbers below link to my code for the solution, statements of the problems can be [...]

[...] in python, for ease, but I knew I had to convert to another language eventually for the language challenge. I ended up going with C, and while C works, I ran into...a bit of an issue. In Python I [...]

[...] Below is the table of my progress on this Language Challenge. The numbers below link to my code for the solution, statements of the problems can be [...]

[...] because it was pretty easy to create my solution to this problem from the last. Still dynamic programming, still similar probably of counting the ways to write a number as a sum. Because I had a [...]

[...] free for use. Problem 78 was a bit annoying for me. Problem 76, I decided to solve using dynamic programming as it was pretty easy to do so, and that solution generalized really well to problem 77. [...]

[...] . Now, the combination of the fact that the solution was found through dynamic programming and the fact that it is written in Forth may make the solution unintelligible to most [...]

[...] language that I have used in my life for something, I have used in this blog to solve a Project Euler problem. However, this has not been the case for quite all languages. As I do work in the graphics [...]

[...] So, it has been a little while since I have solved a Project Euler problem for this challenge - I decided to take Winter Break off, and now that I have been at [...]

[...] have one final exam left to take, so clearly today was the perfect day to solve another Project Euler problem in the morning. I have a solution written down in Python for problem 86 that I am ready to [...]

[...] 75. I never did solve this problem before (reason why probably because I worked in a functional programming language my first time through Euler, and this problem begs for a big array or dictionary). [...]

[...] was found, writing up a solution isn't too bad. I solved this problem in Idris, a functional programming language with fully dependent types. The theory behind all that stuff seems cool and I will [...]

[...] lists, checking for palindromes, etc are very natural things to do in a functional programming language. Anyway, Elixir was a pretty nice language: most of my issues came from [...]

[...] . It was easy to build, run, yada yada, its a compiled language that compiles to C with pretty C-like syntax, yep, pretty solid in the basics. Neat advantage: it was written by the author of vim: [...]

[...] (Extensible Embeddable Language) wasn't too hard to pick up how to use, having a very C-like syntax, though it has next to no documentation, which made things a bit hard. And indeed, the [...]

[...] 't stop development over a decade ago. Using Linotte was surprisingly easy, it has a very C-like syntax, other than using a lot of French words. This was a pretty fun language to use, and I [...]

[...] up, having not used it since my initial solution to problem 22. D is a fine language with C-like syntax which compiles directly to native code and lets you do all sorts of stuff that one would want [...]

[...] below 10^7 would not be fun/fast), but still not as smart as some of the solutions on the Euler problem. My solution works using the fact that the solution must have very few prime factors, but I do [...]

[...] across input problems: When I first found a bad LCG that gave the right answer to the euler problem, it did not give the correct answer in the class 6-sided dice monopoly case, so it was clearly [...]

[...] very odd one - I was trying to use a words.txt I had probably downloaded for an earlier Euler problem, while looking at the version online to determine the format. The formats were different, [...]

[...] So, after solving problem 45 in Rexx, I had R open and free for use. Problem 78 was a bit annoying for me. Problem 76, [...]

[...] (with some OO features) that runs on the Erlang VM. So, it was a very good language for solving Problem 55, as reversing lists, checking for palindromes, etc are very natural things to do in a [...]

[...] So, after solving problem 89 in Parrot Assembly, I claimed that I was interesting in trying out Java Bytecode. So, I [...]