I decided to step up to Guff's challenge

[ncba93ivyase]

my solution for 48:

Code Select

x = str(sum(i**i for i in range(1, 1001)))
print x[-10:]

Looks like JMV got a whoopin', and I thought of guff when I worked towards this clean solution 

[guff]

my solution for 48:

Code Select

x = str(sum(i**i for i in range(1, 1001)))
print x[-10:]

Looks like JMV got a whoopin', and I thought of guff when I worked towards this clean solution 

yours is still silly
there's no need whatsoever to assign it to a variable and then have a separate line to print the answer:

Code Select

print str(sum(i**i for i in range(1, 1001)))[-10:]
would make more sense while still sticking to your method

but my solution is still more than ten times faster:

Code Select

print(sum(pow(i, i, 10**10) for i in range(1, 1001)) % 10 ** 10)

[ncba93ivyase]

yours is still silly
there's no need whatsoever to assign it to a variable and then have a separate line to print the answer:

Code Select

print str(sum(i**i for i in range(1, 1001)))[-10:]
would make more sense while still sticking to your method

but my solution is still more than ten times faster:

Code Select

print(sum(pow(i, i, 10**10) for i in range(1, 1001)) % 10 ** 10)

well then i learned some more today

[guff]

oh god i just realized the link in my first post wasn't even to my profile but i fixed it now

also jamie solved problem 4

[Daddy]

Code Select

#!/usr/bin/python
# Filename : Euler_006.py
#Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.
sumOfSquares, squareOfSums = 0, 0
for i in range(1,101):
sumOfSquares+= i**2
squareOfSums+=i
print squareOfSums**2 - sumOfSquares
Well, my original code was

Code Select

#!/usr/bin/python
# Filename : Euler_006.py
#Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.
sumOfSquares=0
squareOfSums = 0
Sums = 0
for i in range(1,101):
sumOfSquares+= i**2
Sums+=i
squareOfSums=Sums**2
print squareOfSums - sumOfSquares
because I didn't know you could do math in the print statement, but other than that it was close to what guff had.

[guff]

...but other than that it was close to what guff had.

uh no i had a one liner 

the long code i had wasn't anything i used it was just to show lawlz what he probably should have done instead 

[Gladjaframpf]

A challenge: Do #79 on paper. I found it surprisingly easy.

[ncba93ivyase]

I didn't know you could do math in the print statement, but other than that it was close to what guff had.

That's the very first thing any python guide teaches you.

[Daddy]

That's the very first thing any python guide teaches you.

Well I guess me not reading any guides would be a factor.   

[guff]

A challenge: Do #79 on paper. I found it surprisingly easy.

that actually does seem doable 

i'll try it later maybe

also i think i'm going to try and do some of the problems i've already done in c

[Daddy]

I did #79 in TextEdit only because I didn't want to waste paper.
[spoiler]73162890[/spoiler]

I had to register another account to test that so when I do it with actual code I won't feel like I cheated by submitting a problem with no programming. 

[guff]

Solved 4:

Code Select

y = []
for i in range(100, 1000):
x = str(i*i)
if x == x[::-1]:
y.append(int(x))
print max(y)

Now I've just got to make a slimmer solution

uh that gives the wrong answer

you're assuming that the asnwer will be a perfect square (hint: it isn't) 

[Daddy]

uh that gives the wrong answer

you're assuming that the asnwer will be a perfect square (hint: it isn't) 

I just ran that too and the answer is way off. 

[guff]

lol jmv beat lawlz 

[Daddy]

lol jmv beat lawlz 

what was that

I just wonder if JMV could actually do any of them