Project Euler

[GrandizerII]

[SteelCurtain]

Oooh... I like.

I solved the first two pretty quickly.

Using C++.

[GrandizerII]

Oooh... I like.

I solved the first two pretty quickly.

Using C++.

I'm using Python: the programming language for lazy people like me who don't want to type parentheses or braces more than they should.

[SteelCurtain]

[GrandizerII]

[SteelCurtain]

Seriously, these are fun and challenging.

Usually, my code is pretty hacky because I don't care about anything but the result, but I love these challenges.

[GrandizerII]

Seriously, these are fun and challenging.

Usually, my code is pretty hacky because I don't care about anything but the result, but I love these challenges.

Where you up to, Steel?

If by hacky, you mean running fragments of code, extracting the intermediate answers, and then using those answers as part of the data for the final code, then yep, that's what I did for a couple of them thus far.

[SteelCurtain]

I'm working on #12 right now.

I'm on a slow shitty computer at work using Python and IDLE now. The summation of primes problem was too much for the online shells, they time out after like 5 seconds, the stingy bastards. Hard to sum all of the primes below 2,000,000 in 5 seconds with an online shell.

Now I am finding all of the divisors in triangle numbers, finding the first triangle number with more than 500 divisors. The code was easy, but it's been running for quite a time. I've tried to make it as economical as possible, but I don't care to think too hard about it.

That's what I mean by hacky: maybe not the most efficient code, and that's why this is good practice. I am trying to loop as few times as possible when having nested loops running two million times.

[GrandizerII]

I'm working on #12 right now.

I'm on a slow shitty computer at work using Python and IDLE now. The summation of primes problem was too much for the online shells, they time out after like 5 seconds, the stingy bastards. Hard to sum all of the primes below 2,000,000 in 5 seconds with an online shell.

Now I am finding all of the divisors in triangle numbers, finding the first triangle number with more than 500 divisors. The code was easy, but it's been running for quite a time. I've tried to make it as economical as possible, but I don't care to think too hard about it.

That's what I mean by hacky: maybe not the most efficient code, and that's why this is good practice. I am trying to loop as few times as possible when having nested loops running two million times.

Can I give you a hint on how to deal with primes in the case of very large numbers?

[SteelCurtain]

Sure!

To be clear, I didn't actually loop through every number. I skipped evens, and I didn't check for factors after 1/3 of the number I was checking.