I decided to step up to Guff's challenge

[Gladjaframpf]

So I've been working with MIPS assembly recently and you've inspired me to try some of the PE problems with it. I solved the first two, but I've run into a bit of a problem in that the assembler I'm using doesn't actually have all the MIPS opcodes built into it and I'd really like to be able to use bitwise logic operations so I might have to find a new assembler.

[guff]

oh shit of course he has to show up

at least i can still beat lawlz and jmv 

[Daddy]

so im on problem 3 and i think i did it right after some help on factorization and lists since i never used them.

now my code is taking a long time to run i hope it works ^___^

[guff]

...after some help...

AND I HAVE THE IM LOGS TO PROVE IT

[Gladjaframpf]

oh shit of course he has to show up

at least i can still beat lawlz and jmv 

You've solved like twice as many PE problems as I have.

[guff]

You've solved like twice as many PE problems as I have.

yeah but i've had an account for a while now and i'm not using assembly language

[Daddy]

OverflowError: long int too large to convert to int

[Daddy]

Code Select

#!/usr/bin/python
# Filename : Euler_003.py
# The prime factors of 13195 are 5, 7, 13 and 29.
# What is the largest prime factor of the number 600851475143?
EUL = 600851475143
#Function for finding primes
def isPrime(n):
import math
if n<2:
  return False #Negative Numbers, 0, and 1 are not prime.
elif n==2:
  return True #2 is Prime
elif n%2==0:
  return False #Even numbers, other than 2, are not prime.
else:
  for i in range(3, int(math.sqrt(n))+1,2):
   if n%i==0:
    return False #Number is composite
  else:
   return True  #All others are prime
#Find Factors
factor_list = []
primeFactors = []
i = 3
while True:
if EUL%i==0:
  while EUL % i == 0:
   EUL /= i
   factor_list.append(i)
if EUL == 1:
  break
i+=2 
#Take the list of factors and keep only the prime factors.
for factor in factor_list:
if isPrime(factor):
  primeFactors.append(factor)
print max(primeFactors)

[Gladjaframpf]

yeah but i've had an account for a while now and i'm not using assembly language

I actually did most of the problems I've done sometime last fall in Scheme.

Assembly isn't that bad for the easier ones, but it gets really messy when you need anything complicated. Function calls are horrible because you have to handle all the memory allocation manually.

[ncba93ivyase]

at least i can still beat jmv 

i think anyone can

[Daddy]

i think anyone can

because lack of actually doing the programs because I don't care enough = lack of ability.

[guff]

i think anyone can

jmv is actually doing okay for a beginner but what's your excuse 

[ncba93ivyase]

jmv is actually doing okay for a beginner but what's your excuse 

laziness and the vidya and a highly irregular sleep schedule  that keeps me from ever being able to focus and apply myself to anything

And if anything, JMV should be the "professional" here since he is (or was) studying to be a computer scientist. I just slowly picked up Python over the summer.

[Daddy]

Just did problem 48 

Code Select

#!/usr/bin/python
# Filename : Euler_048.py
#Find the last ten digits of the series, 1**1 + 2**2 + 3**3 + ... + 1000**1000
result = 0
for i in range(1,1001):
result+= i**i
print str(result)[-10:]

And if anything, JMV should be the "professional" here since he is (or was) studying to be a computer scientist. I just slowly picked up Python over the summer.

Because knowing one language makes you a professional in every programming language.
Write a compiler for Java so you don't have to use the JVM, since you know python and that makes you a professional in any language.
Also, as you said, my problem is:

laziness and the vidya and a highly irregular sleep schedule  that keeps me from ever being able to focus and apply myself to anything

[ncba93ivyase]

Because knowing one language makes you a professional in every programming language.

when did i say we had to solve these in python