The Project Euler thread

[benguino]

leonid on a roll

[beary605]

right after 100 you get slapped with special subset sums

man it will be hard to find the tricks for working with these

[leonid]

Took me a while

[leonid]

lol this problem :P

[Reincarnate]

Best answer ever

[LongGone]

Originally Posted by Reincarnate

Best answer ever

Goddamnit

[leonid]

woot

[kaiten123]

Originally Posted by leonid

lol this problem :P

Originally Posted by Reincarnate

Best answer ever

Originally Posted by LongGone

Goddamnit

wow, i wonder what kind of problem/answer these guys are talking about


oh.... wwwooooww

[leonid]

Level 9 (O:

[beary605]

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

[leonid]

That was really tough

[Reincarnate]

I also recall 177 being pretty hard for being an earlier problem

[leonid]

I'm just knocking out unsolved problems with most solvers



Easy

[leonid]

yess

[leonid]

hue hue

[leonid]

woohoo

[stargroup100]

leonid blasting through these

[leonid]

fun

[stargroup100]

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

[stargroup100]

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:

Took 0.485 seconds to generate prime list up to 1000000. problem35.html:46
For 11, all digit rotations are prime: 11 problem35.html:100
For 13, all digit rotations are prime: 13,31 problem35.html:100
For 17, all digit rotations are prime: 17,71 problem35.html:100
For 37, all digit rotations are prime: 37,73 problem35.html:100
For 79, all digit rotations are prime: 79,97 problem35.html:100
...
A total of ????? circular primes. problem35.html:111
Took 0.862 seconds.

im bad ;_;