Re: The Project Euler thread
leonid on a roll
|
Re: The Project Euler thread
|
Re: The Project Euler thread
Took me a while |
Re: The Project Euler thread
lol this problem :P |
Re: The Project Euler thread
Best answer ever
|
Re: The Project Euler thread
Quote:
|
Re: The Project Euler thread
woot |
Re: The Project Euler thread
|
Re: The Project Euler thread
Level 9 (O: |
Re: The Project Euler thread
http://projecteuler.net/problem=66, diophantine equation
i remember trying to solve this one on pencil and paper the facepalm i got after googling it was huge |
Re: The Project Euler thread
That was really tough |
Re: The Project Euler thread
I also recall 177 being pretty hard for being an earlier problem
|
Re: The Project Euler thread
I'm just knocking out unsolved problems with most solvers
Easy |
Re: The Project Euler thread
yess |
Re: The Project Euler thread
hue hue |
Re: The Project Euler thread
woohoo |
Re: The Project Euler thread
leonid blasting through these
|
Re: The Project Euler thread
fun |
Re: The Project Euler thread
after all of the fuss about problem 218 I decided to take a look for myself
as soon as I saw the problem I knew my method of approach. so excited to try this right now EDIT: so after 30 min of pencil/paper I realized that I didn't even need to write any code WHAT THE FUCK IS THAT SHIT this question is fucking troll |
Re: The Project Euler thread
ugh I really need to know how to code more efficiently and faster. I'm trying to blow through the early problems, and while they're obnoxiously easy, I find myself writing a lot of code, which ends up taking up a lot of time
often times my pencil/paper method is faster -__- like for example, #35 asks to count up circular primes below 1 mil. code is approx 100 lines long, with the following output: im bad ;_; |
All times are GMT -5. The time now is 08:46 AM. |
Powered by vBulletin® Version 3.8.1
Copyright ©2000 - 2024, Jelsoft Enterprises Ltd.
Copyright FlashFlashRevolution