Members in Shoutbox
None.

Shoutbox Search
Search for:


Shoutbox Commands
/w [name] > Whisper
/r > Reply to last whisper
/me > Marks as action

Shoutbox Information
Moderators may delete any and all shouts at will.
Global Shoutbox
Please log in to shout.
Pages: < 1 « 3141 3142 3143 3144 31453539 >

[2014-12-20. : 3:46 pm]
Roy -- Zycorax
Zycorax shouted: You should at least do the first part
I would say routine exercise is more beneficial in the long run.
[2014-12-20. : 2:53 pm]
Sacrieur -- nts nts nts nts
[2014-12-20. : 2:48 pm]
Sacrieur -- DONT TOUCH THAT DIAL!
[2014-12-20. : 2:48 pm]
Sacrieur -- xD
[2014-12-20. : 2:48 pm]
Sacrieur -- I mean one week.
[2014-12-20. : 2:48 pm]
Sacrieur -- whoops
[2014-12-20. : 2:48 pm]
Sacrieur -- SEN Rampage is happening in a month.
[2014-12-20. : 2:39 pm]
Zycorax -- You should at least do the first part
[2014-12-20. : 12:44 pm]
Moose -- I should delete facebook, lawyer up, and hit the gym
[2014-12-20. : 12:43 pm]
Moose -- Ahhhhh
[2014-12-20. : 12:42 pm]
Roy -- I was just giving the general SEN advice and vibe to make you feel better.
[2014-12-20. : 12:35 pm]
Moose -- It can't suck anything up, that's the problem
[2014-12-20. : 12:35 pm]
Roy -- Suck it up, buttercup.
[2014-12-20. : 12:33 pm]
Moose -- ... body, what are even making this poop from
[2014-12-20. : 12:33 pm]
Moose -- Oh no, not again
[2014-12-20. : 12:22 pm]
Moose -- Inferno, kill me.
[2014-12-20. : 12:21 pm]
Moose -- I didn't know it was possible for me to shit as many times and as much as I did.
[2014-12-20. : 12:20 pm]
Moose -- I survived the night.
[2014-12-20. : 12:17 pm]
lil-Inferno -- Once you figure out the pattern though, it's easy.
[2014-12-20. : 12:14 pm]
lil-Inferno -- FaRTy1billion
FaRTy1billion shouted: 15 is taking too long, and I'm too lazy to optimize it. ;o
If you're following actual paths you're doing it wrong.
[2014-12-20. : 8:52 am]
O)FaRTy1billion[MM] -- If I ordered one day before I did then it would have shipped, and if I ordered a few days before I did I'd have it by now
[2014-12-20. : 8:51 am]
O)FaRTy1billion[MM] -- My soylent didn't ship. :( No shipments are listed on the tracker for today.
[2014-12-20. : 8:37 am]
l)ark_ssj9kevin -- euler himself
[2014-12-20. : 8:33 am]
O)FaRTy1billion[MM] -- Who comes up with these problems?
[2014-12-20. : 8:22 am]
O)FaRTy1billion[MM] -- I was doing this all evening, and I forgot I was going to get pizza. Now I'm hungry and it's time for bed. D:
[2014-12-20. : 8:15 am]
O)FaRTy1billion[MM] -- the hardest part about 17 was spelling the numbers correctly ><
[2014-12-20. : 8:01 am]
Aristocrat -- inferno will beat me at this rate he churns through it too fast
[2014-12-20. : 8:01 am]
Aristocrat -- must stalk progress
[2014-12-20. : 8:01 am]
Aristocrat -- Add me on your friends for PE
[2014-12-20. : 7:58 am]
O)FaRTy1billion[MM] -- I used a recursive algorithm, but apparently it's not a good one. :(
[2014-12-20. : 7:57 am]
Aristocrat -- 15 solves in under one second with a good recursive algorithm
[2014-12-20. : 7:41 am]
O)FaRTy1billion[MM] -- I listed a bunch of numbers, saw that for n the result was divisible by n+1, but that's as far as I got
[2014-12-20. : 7:40 am]
O)FaRTy1billion[MM] -- I don't know the math for it
[2014-12-20. : 7:40 am]
l)ark_ssj9kevin -- i did 15 with a calculator ;)
[2014-12-20. : 7:36 am]
O)FaRTy1billion[MM] -- 15 is taking too long, and I'm too lazy to optimize it. ;o
[2014-12-20. : 6:33 am]
trgk -- i+=i+++--i
[2014-12-20. : 5:54 am]
Aristocrat -- Add me if you're still doing it, 93822_a00be260a9c8cc43c708987e48b225b4
[2014-12-20. : 5:54 am]
Aristocrat -- Jack
Jack shouted: I should try do one a day until I've got them all done. How regularly do they release new problems?
I'm not sure, but over the last couple years it went from ~100 problems to almost 500
[2014-12-20. : 5:51 am]
Aristocrat -- Jesus you beat me in problem count for a sec there inf
[2014-12-20. : 5:33 am]
O)FaRTy1billion[MM] -- except when in my attempts to optimize I forget to make a duplicate case not possible. :P
[2014-12-20. : 5:33 am]
O)FaRTy1billion[MM] -- These are pretty easy ;o
[2014-12-20. : 5:32 am]
O)FaRTy1billion[MM] -- Congratulations, the answer you gave to problem 12 is correct. You are the 112723rd person to have solved this problem.
[2014-12-20. : 5:25 am]
O)FaRTy1billion[MM] -- and apparently there is a problem. :(
[2014-12-20. : 5:23 am]
O)FaRTy1billion[MM] -- So I made the change, ran the program again, and it finished almost immediately. xD
[2014-12-20. : 5:23 am]
O)FaRTy1billion[MM] -- lol, my program was running and running and running, then I realized how silly it is for me to do "for(i=1;i<=a;i++){ if((a%i) == 0) c++; } return c;" since every time you find a divisor of a number, you can divide the number to get a new max value that rapidly gets less and less.
[2014-12-20. : 5:11 am]
jjf28 -- farty's clearly mafia
[2014-12-20. : 5:00 am]
O)FaRTy1billion[MM] -- for(a=0,i=1;r<500;a+=i++) oh, what fun!
[2014-12-20. : 4:57 am]
O)FaRTy1billion[MM] -- woo, I get to a+=i++; :awesome:
[2014-12-20. : 4:51 am]
O)FaRTy1billion[MM] -- Disregard. I was printing the wrong variable. :wob:
[2014-12-20. : 4:47 am]
O)FaRTy1billion[MM] -- What is 11 even asking? I thought I understood, and then it says I am wrong. ;o
[2014-12-20. : 4:10 am]
lil-Inferno -- FaRTy1billion
FaRTy1billion shouted: lil-Inferno Did you get it yet?
Haven't looked at it much.
[2014-12-20. : 3:41 am]
O)FaRTy1billion[MM] -- The most time-consuming part was setting up how I wanted to do it. xD
[2014-12-20. : 3:40 am]
O)FaRTy1billion[MM] -- Congratulations, the answer you gave to problem 33 is correct. You are the 39465th person to have solved this problem.
[2014-12-20. : 3:40 am]
O)FaRTy1billion[MM] -- lil-Inferno
lil-Inferno shouted: I'm doing 33 now. Skipped ahead to 34 because it was trivially easy.
Did you get it yet?
[2014-12-20. : 3:20 am]
O)FaRTy1billion[MM] -- it looks like some get more math-y as you go along
[2014-12-20. : 3:14 am]
Jack -- I should try do one a day until I've got them all done. How regularly do they release new problems?
[2014-12-20. : 3:13 am]
Jack -- None of it's particularly mathematically challenging so far, just there are some tricks regarding the maths that can make things quicker if you know them
[2014-12-20. : 3:07 am]
Moose -- It's amusing to see how much easier it is to get far coming from a CS background instead of a math background.
[2014-12-20. : 3:06 am]
lil-Inferno -- Get rekt Jack.
[2014-12-20. : 3:06 am]
Moose -- You should learn J if you hate typing, you just randomly arrange symbols
[2014-12-20. : 3:05 am]
Jack -- Because some look like too much typing :D
[2014-12-20. : 3:04 am]
Jack -- I've only done 21 of them, skipped a couple though and jumped ahead a bit
[2014-12-20. : 3:04 am]
Jack -- inferno churning ahead on prorekt eulerino
[2014-12-20. : 3:01 am]
Moose -- Ruldoph the rekt-nosed rektdeer, had a very shiny nose
[2014-12-20. : 2:55 am]
lil-Inferno -- I'm doing 33 now. Skipped ahead to 34 because it was trivially easy.
[2014-12-20. : 2:50 am]
O)FaRTy1billion[MM] -- lil get stuck on another one so I can do it first without starting at problem 1.
[2014-12-20. : 2:49 am]
O)FaRTy1billion[MM] -- xD I already had a list of the first 10,000 primes, so finding the 10,001st was extremely simple. Though if I didn't already have this list I could've just done the same method 10,000 times I guess.
[2014-12-20. : 2:47 am]
lil-Inferno -- Congratulations, the answer you gave to problem 34 is correct. You are the 52304th person to have solved this problem.
[2014-12-20. : 2:44 am]
O)FaRTy1billion[MM] -- 6 is also trivial ;o Though I didn't do it manually.
[2014-12-20. : 2:41 am]
Moose -- No, 5 is pretty easy even to do manually, I know I did

Pages: < 1 « 3141 3142 3143 3144 31453539 >


Members Online: jun3hong