Staredit Network Global Shoutbox
Members in Shoutbox
None.

Shoutbox Search
You may search for a phrase in the shoutbox.

Search for:


Shoutboxcommands
/w [name] Whispers.
/r Answers to whisperer.
/me Marks as action.

Shoutbox Information
Moderators may delete one or more of your shouts at any given time without notice and reason.
The Shoutbox may be good to ask for small pieces of advice, but for real questions, you still want to use our Forums
Global Shoutbox
Please log in to shout.

[08: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
[08:51 am]
O)FaRTy1billion[MM] -- My soylent didn't ship. :( No shipments are listed on the tracker for today.
[08:37 am]
l)ark_ssj9kevin -- euler himself
[08:33 am]
O)FaRTy1billion[MM] -- Who comes up with these problems?
[08: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:
[08:15 am]
O)FaRTy1billion[MM] -- the hardest part about 17 was spelling the numbers correctly ><
[08:01 am]
Aristocrat -- inferno will beat me at this rate he churns through it too fast
[08:01 am]
Aristocrat -- must stalk progress
[08:01 am]
Aristocrat -- Add me on your friends for PE
[07:58 am]
O)FaRTy1billion[MM] -- I used a recursive algorithm, but apparently it's not a good one. :(
[07:57 am]
Aristocrat -- 15 solves in under one second with a good recursive algorithm
[07: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
[07:40 am]
O)FaRTy1billion[MM] -- I don't know the math for it
[07:40 am]
l)ark_ssj9kevin -- i did 15 with a calculator ;)
[07:36 am]
O)FaRTy1billion[MM] -- 15 is taking too long, and I'm too lazy to optimize it. ;o
[06:33 am]
trgk -- i+=i+++--i
[05:54 am]
Aristocrat -- Add me if you're still doing it, 93822_a00be260a9c8cc43c708987e48b225b4
[05: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
[05:51 am]
Aristocrat -- Jesus you beat me in problem count for a sec there inf
[05:33 am]
O)FaRTy1billion[MM] -- except when in my attempts to optimize I forget to make a duplicate case not possible. :P
[05:33 am]
O)FaRTy1billion[MM] -- These are pretty easy ;o
[05: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.
[05:25 am]
O)FaRTy1billion[MM] -- and apparently there is a problem. :(
[05:23 am]
O)FaRTy1billion[MM] -- So I made the change, ran the program again, and it finished almost immediately. xD
[05: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.
[05:11 am]
jjf28 -- farty's clearly mafia
[05:00 am]
O)FaRTy1billion[MM] -- for(a=0,i=1;r<500;a+=i++) oh, what fun!
[04:57 am]
O)FaRTy1billion[MM] -- woo, I get to a+=i++; :awesome:
[04:51 am]
O)FaRTy1billion[MM] -- Disregard. I was printing the wrong variable. :wob:
[04:47 am]
O)FaRTy1billion[MM] -- What is 11 even asking? I thought I understood, and then it says I am wrong. ;o
[04:10 am]
lil-Inferno -- FaRTy1billion
FaRTy1billion shouted: lil-Inferno Did you get it yet?
Haven't looked at it much.
[03:41 am]
O)FaRTy1billion[MM] -- The most time-consuming part was setting up how I wanted to do it. xD
[03: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.
[03: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?
[03:20 am]
O)FaRTy1billion[MM] -- it looks like some get more math-y as you go along
[03:14 am]
Jack -- I should try do one a day until I've got them all done. How regularly do they release new problems?
[03: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
[03:07 am]
Mini Moose 2707 -- It's amusing to see how much easier it is to get far coming from a CS background instead of a math background.
[03:06 am]
lil-Inferno -- Get rekt Jack.
[03:06 am]
Mini Moose 2707 -- You should learn J if you hate typing, you just randomly arrange symbols
[03:05 am]
Jack -- Because some look like too much typing :D
[03:04 am]
Jack -- I've only done 21 of them, skipped a couple though and jumped ahead a bit
[03:04 am]
Jack -- inferno churning ahead on prorekt eulerino
[03:01 am]
Mini Moose 2707 -- Ruldoph the rekt-nosed rektdeer, had a very shiny nose
[02:55 am]
lil-Inferno -- I'm doing 33 now. Skipped ahead to 34 because it was trivially easy.
[02:50 am]
O)FaRTy1billion[MM] -- lil get stuck on another one so I can do it first without starting at problem 1.
[02: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.
[02:47 am]
lil-Inferno -- Congratulations, the answer you gave to problem 34 is correct. You are the 52304th person to have solved this problem.
[02:44 am]
O)FaRTy1billion[MM] -- 6 is also trivial ;o Though I didn't do it manually.
[02:41 am]
Mini Moose 2707 -- No, 5 is pretty easy even to do manually, I know I did
[02:40 am]
O)FaRTy1billion[MM] -- Was problem 5 supposed to be done with a program? I just did it with notepad in like less than 5 minutes. ;o
[02:18 am]
Mini Moose 2707 -- #ThankYouForSharing :moose:
[02:18 am]
Mini Moose 2707 -- If it doesn't come out one way, it comes out the other.
[02:17 am]
Mini Moose 2707 -- Well, looks like the tea is staying down. However, my bowels have made known their fury.
[01:54 am]
lil-Inferno -- rekt
[01:40 am]
Mini Moose 2707 -- try { drinkTea(); } catch (Exception vomit) { getRekt(); }
[01:34 am]
Mini Moose 2707 -- Ok ok ok, I'm going to try drinking tea. If I puke up tea, then it's all ogre.
[01:32 am]
Mini Moose 2707 -- FaRTy1billion
FaRTy1billion shouted: These would be more fun at work. If only I had a C compiler at work
FaRTy1billion
FaRTy1billion shouted: I could throw together a quick PHP script to upload & run code, except my work blocks my server (probably because it's from a private IP)
FaRTy1billion
FaRTy1billion shouted: Or I could use Javascript and use a Javascript sandbox ... except IE might explode all over it
FaReKT1billion
[01:32 am]
O)FaRTy1billion[MM] -- Or I could use Javascript and use a Javascript sandbox ... except IE might explode all over it
[01:32 am]
O)FaRTy1billion[MM] -- I could throw together a quick PHP script to upload & run code, except my work blocks my server (probably because it's from a private IP)
[01:31 am]
O)FaRTy1billion[MM] -- These would be more fun at work. If only I had a C compiler at work
[01:31 am]
O)FaRTy1billion[MM] -- :wob:
[01:30 am]
Mini Moose 2707 -- Which is true, but only part of the story
[01:30 am]
lil-Inferno -- I didn't realize you couldn't use the same product. I thought the hint meant you couldn't do something like 39 x 186 and then 186 x 39 lel.
[01:29 am]
lil-Inferno -- Congratulations, the answer you gave to problem 32 is correct. You are the 38346th person to have solved this problem.
[01:29 am]
Mini Moose 2707 -- Tell Dem0n that if I don't make it, he has to take up cookie clicker and reach 1 octillion for me
[01:29 am]
Mini Moose 2707 -- I'd give it a shot but wow I'm so rekt I feel lik eI'm dying :rip: :moose: :lock:
[01:27 am]
Mini Moose 2707 -- lil-Inferno
lil-Inferno shouted: Mine runs instantly. Problem is the output's wrong ;-;
jingle bell, jingle bell, jingle bell REKT
[01:26 am]
Mini Moose 2707 -- lil-Inferno
lil-Inferno shouted: I keep getting 56370.
rekting around the christmas tree, have a happy holiday
[01:09 am]
O)FaRTy1billion[MM] -- The hint says not to count a*b=x and c*d=x as unique ;o



Members Online: None.