« first day (2365 days earlier)      last day (2771 days later) » 

17:00
apparently INPUT DOES NOT EXIST IN THIS LANGUAGE
@LeakyNun * You may not post twice (or more) in a row.
@BrianJ oh...
@LeakyNun No, you cannot post twice in a row
ok, I'll post my code when I figure it out
how the hell do you take input in this language
how is a language useful if it has no proper I/O
17:01
do you have any link to docs?
many docs, none of which actually say anything about input
there's output
gib link
@HyperNeutrino costs money
17:02
ಠ_ಠ
can I just write NumberOfPermutationGroups
and submit that as an answer
functions are allowed right
@HyperNeutrino sure but test it first if you can. Give me 10 mins to read the docs
lol that's 25 bytes
!$#%@#%
lol
17:04
Add 2 semicolons
whitespace?
For anyone competing in the answer, add whitespace if needed.
@flawr >_<
Your program doesn't need to be golfed
17:04
-3
Q: c++ or c program on The Great Pile Up

user72520There are several piles of cards on the table arranged from left to right. All of them do not contain the same number of cards. As the boss insists on symmetry, Ramu is asked to merge the minimum number of adjacent piles so that if a list of the number of cards in each pile is given in left to ri...

It's also 1 - indexed
@flawr the sad part is I've seen that in LA
@flawr ah cool
A function's not gonna work
17:05
so switzerland is like security guard country :p
@totallyhuman There is -1 :/
@HyperNeutrino NumberOfPermutationGroups(n+1) ?
@flawr I see, you've never been to America before :P
@BrianJ that's a snippet though
17:06
NrPrimitiveGroups is 17 bytes lol
Lol that's A000027 :0
who is Ramu
opening plagarism checker lol
Posted it
0
Q: Most efficient cubifier

MD XFCubically is too tedious to manually write any code in. Your challenge is to translate ASCII text into Cubically source code. Cubically This is just a quick run-down of Cubically; the repository has a more complete guide and details. Cubically is an esolang I wrote a while ago, designed to be ...

@cairdcoinheringaahing Oh, are snippets bad for this?
(apparently I can't click on reply buttons correctly)
@BrianJ snippets are a complete no-no for all challenges
17:08
snippets are mostly always bad
I was thinking about downloading magma and spend, say $10 on it, looked on the download thing and it costs $2200!
@cairdcoinheringaahing Ahh....I think I'm confusing what snippet means because I don't understand magma. Thanks for the clarification :)
I was thinking function while reading/writing snippet
screw mathjax lol
@Downgoat I have, but actually I've seen less guns than I usually see in my country (well apart from when I visited walmart).
lolno I won't solve A19.
17:11
@HyperNeutrino $mathjaxsaysscrewyou$
@HyperNeutrino I found a way for taking input!
load "filename" reads from a file
@MDXF is it reproduced in the offline version?
oh that's good
lol but that's from a file
that's fine
17:12
are we allowed to assume that input is stored in a file?
@HyperNeutrino what was the builtin again?
i/o by files is allowed
@HyperNeutrino STDIN is a file
NumberOfPermutationGroups(load "a")
brb posting
noice!
17:13
@HyperNeutrino can't be a snippet
needs to be print NumberOfPermutationGroups(load "a")
How about f := function (n); return NumberOfPrimitiveGroups(n+1); end function;?
@LeakyNun Yep
@HyperNeutrino hold on, checking which is better sequence for next
If there's an REPL where you can use the first that would be fine too
REPL is ok as long as you say it's REPL
17:15
ok
You can call my f function in the online calculator like so f(1)
@cairdcoinheringaahing Number of primitive permutation groups of degree n lolno
DAMMIT THEY'RE ALL ABOUT PARTITIONS
17:16
ugh
and Jelly has been used, which has a partition builtin lol
Can't do A70
add more whitespace
@HyperNeutrino do 41 as its simply partitions
mhm
just golf the jelly interpreter lol
17:16
yeah i can do python 2
@HyperNeutrino Python has a builtin in a module
or Python 1
@cairdcoinheringaahing wat ._.
17:17
itertools
1
A: get all the partitions of the set python with itertools

AperoI wrote this one for fun: def partition(a_list): yield [[x] for x in a_list] for i in range(1, len(a_list) + 1): _l = a_list[:] yield [_l.pop(i-1), _l] yield a_list my_list = [1, 2, 3] print list(partition(my_list)) #or for p in partition(my_list): print p

@HyperNeutrino How about A000068?
64
I lied
what happened to the magma answer?
PrimitiveGroups, not PermutationGroups
not posted yet
17:19
3
Q: Most efficient cubifier

MD XFCubically is too tedious to manually write any code in. Your challenge is to translate ASCII text into Cubically source code. Cubically This is just a quick run-down of Cubically; the repository has a more complete guide and details. Cubically is an esolang I wrote a while ago, designed to be ...

0
Q: Very negative calculator

Bryce SullivanYou are a very avid mathematician and programmer, so much so the +,/,*,^ keys have all been rubbed off your keyboard! Leaving subtraction ! You need to calculate your homework but now can only do it in subtraction! Write a program to do it all in subtraction! Input: The input to the program wi...

Posted
oh god that votebait
33 seconds +3 votes
I love ETH's comment
lol
too bad I'm capped already
The next sequence isn't that nice either tho
5
A: Sandbox for Proposed Challenges

Conor O'BrienCreate a percent sign code-golf ascii-art Given an integer n ≥ 1, output a 2D representation† of a percent sign of width n. The construction goes as follows: Create an n by n matrix filled with zeroes. Insert ones in the top-left and bottom-right corners. Place ones on the diagonal from the b...

any last thoughts ?
17:21
@cairdcoinheringaahing I'm working on it :)
I mean it's hard to get such a trivial challenge wrong but just in case
@HyperNeutrino Can you please increase your byte count by 1?
Joke ˆˆ
@ConorO'Brien It looks good. I though that you already posted it
17:22
actually please do :P
@cairdcoinheringaahing nope, not yet
done
return a -> return(a)
@HyperNeutrino Thanks!
lol +1 byte
17:23
Is anyone working on the bonus to this? I was considering reposting to Math.se, but I wanted to give everyone a chance before the pro's demolish it.
wat it's just partitions -1
alright
time to try this out
@HyperNeutrino what a trap!
17:23
¯\_(ツ)_/¯ idc, I can't post for an hour anyway lol
I think it's good to get the challenge off the ground again
Please let's get a sequence that's not about partitions
Someone go for 27 bytes, please!
@BusinessCat For god sake yes
DAMMIT! M does not have the partition builtin!
M is too old!
17:25
@HyperNeutrino I thought you didn't care ;)
i lied lol (lol==lel whatever)
@HyperNeutrino please
is it ŒṖ
@LeakyNun haha
lol
@totallyhuman that is the Jelly builtin
17:29
The one time where Ohm != Jelly!
@LeakyNun You couldn't post it anyway: answered 48 mins ago
@EriktheOutgolfer this is why you don't use languages where there are a bunch of fancy builtins for trivial ones xD
p=lambda l:[s[:0]+l[:i]for i in range(1,len(l))for s in p(l[i:])]+[l]
@Mr.Xcoder I would just wait until everyone gave up
here partitions golfed
in python 2
17:30
At the moment, Leaky is winning so he has no reason to post
@cairdcoinheringaahing solving A000064 without built-in in linear time is pretty much reason.
is that correct?
@LeakyNun no competing reason
the partitions thing?
@cairdcoinheringaahing that isn't a well-defined term
17:31
wait nope
How much should I golf my stuff down? I have a solution with functions and comments and spacing lol
@BrianJ how long is it?
@cairdcoinheringaahing 2481
hi laser eye person @ThomasWard
It's VB.NET
17:32
o/ @HyperNeutrino
That depends. How much do you want oeis.org/A002481 to be the next sequence?
@cairdcoinheringaahing At least it's not a partition?
@BrianJ go ahead
Wait, I forgot to include sub Main()
I'd prefer A002477
17:33
@BlackCap that could be fun
@HyperNeutrino too late
Wait, I can post just my functions? Do I need the class and main etc?
@BrianJ full program or function
@BrianJ although could you remove 4 characters?
@MDXF
> Number of series-parallel networks with n unlabeled edges. Also called yoke-chains by Cayley and MacMahon.
@BrianJ nevermind MD XF beat you to it
17:35
Really?
@cairdcoinheringaahing Dang....I snooze I looze
So many ninjas on this challenge
@ConorO'Brien :(
@BrianJ hold off a second, there's a dispute about it
@cairdcoinheringaahing Cool. I'll clean mine up just in case
17:36
Why the -3...
@BrianJ remove 4 chars and you're good
5
Q: Create a percent sign

Conor O'BrienGiven an integer n ≥ 1, output a 2D representation† of a percent sign of width n. The construction goes as follows: Create an n by n matrix filled with zeroes. Insert ones in the top-left and bottom-right corners. Place ones on the diagonal from the bottom-left to the top-right. For input n =...

@MDXF make it into a function
@LeakyNun I'm changing back to A64; post your answer.
17:37
@HyperNeutrino yay
Can you not submit just the a(n) = part as a function?
(not familiar with PARI)
@HyperNeutrino @LeakyNun 4 minutes
@BusinessCat I can?
Well whoops
I don't know PARI but if a(n) defines a function that you can call later then yeah it's fine to just do that
17:38
@HyperNeutrino can you change it back so that MD XF can post his?
>.<
great now what do I do
Honestly I think this editing stuff is going downhill
Ok ok I fixed it now please un-downvote :P
look at @ovs's solution, lol
what the....
17:40
Compromise!
My solution will become 65 bytes, which allows MD XF's solution, which allows Leaky Nun's solution!
@MDXF You should update the input field on TIO to a(3) not just 3
Good
cc @LeakyNun
@LeakyNun 1 minute, then you can post
@HyperNeutrino oh, good
17:41
@LeakyNun post it quick before any more edits happen
IT'S THE CHANGE ONE AGAIN
yeah because Leaky Nun solved it
@BusinessCat Done
and I said I'd make it 64 so he could post, but then MD XF wanted to post for 65, so I made mine 65 and his 64 so leaky can post
we can all be happy now be quiet and don't edit :P
17:42
lol, i don't even know what to solve anymore :P
Alright. I just hope I can actually do one at some point :P
I need a trivial sequence soon so I can get cQuents out of the way
@HyperNeutrino your ability in having compromise is quite appreciated... I wouldn't have thought of the solution
@BrianJ Yeah it's crazy
@HyperNeutrino Sorry 'bout that, guys... should've checked chat before posting, my bad
17:42
@LeakyNun what on earth is that sequence?
you're much more mature than your age tells @HyperNeutrino
@LeakyNun thanks :)
> A000131 Number of asymmetrical dissections of n-gon.
> a(n) = (Catalan(n-2) - (n/2)*Catalan(n/2 - 1) - nCatalan(floor(n/2) - 1) - (n/3)*Catalan(n/3 - 1) + nCatalan(n/4 - 1) + n*Catalan(n/6 - 1))/(2*n), where Catalan(x) = 0 for noninteger x (derived from Guy's 1958 paper).
Sooooo, A64, I get 3 for the third entry, not 4. Any thoughts what I'm misunderstanding?
Oh it just uses Catalan numbers looks like. Shouldn't be too bad
17:43
@LeakyNun Thanks Leaky :((((
catalan[n_] := Block[{c = Binomial[2 n, n]/(n + 1)}, If[IntegerQ[c], c, 0]]; f[n_] := (catalan[n - 2] - (n/2) catalan[n/2 - 1] - n*catalan[Floor[n/2] - 1] - (n/3)*catalan[n/3 - 1] + n*catalan[n/4 - 1] + n*catalan[n/6 - 1])/(2 n);
I'm glad that it just so happened that the byte counts were really close so I could alter it a bit to make it work out
AAH WHAT IS THIS NEXT ONE
@HyperNeutrino ^^
also we could just pull solutions from OEIS and be boring ;_;
too bad mathematica's gone
17:44
I struggled to find a decent next sequence, I tell you
Brownie points if you do it in 108 bytes
@LeakyNun DECENT?
anyways
@HyperNeutrino lolololol
i golfed the partitions from jelly
17:44
@Mr.Xcoder Would you have wanted 128 instead?
def p(l):
 r=[]
 for i in range(1,len(l)):
  for s in partitions(l[i:]):s[:0]+=[l[:i]];r+=s,
 return r+[[l]]
dunno if that's any good
@totallyhuman unfortuately you're slightly to late
will be useful the next 10 million times we get a partitions sequence
yes i know
17:45
Yeah, Python 1 and 3 are still valid
ok so we just gotta get a catalan function
@StepHen python 1 and 2
@LeakyNun A132: Number of ways of writing n as a sum of 5 squares.....
hey is R taken?
17:46
@Mr.Xcoder didn't like that
@HyperNeutrino yes, by me \o/
AAH I need 3 answer votes to cap!
@LeakyNun Nor do I lol
Oh yay 4k rep
17:46
@PeterTaylor ah perfect
@cairdcoinheringaahing you'll get there sooner or later lol, it's still early
It was just a strange way of saying you were right @LeakyNun
@cairdcoinheringaahing I already gave you mine
@LeakyNun @HyperNeutrino I know but I'm so close!
lol I capped before I woke up ;_;
17:47
Cool. I only have 2 answers without any votes.
a(n) = 2*(3*n)!/((2*n+1)!*((n+1)!)). A139
lol if Jelly were still in: Ḥc÷‘ for catalan numbers lol
I know we're not supposed to advertise answers for votes here, but I am kinda annoyed that this took me ages, but I get no votes on it :(
@cairdcoinheringaahing Sorry I stole them all
@StepHen with Taxi?
17:49
@LeakyNun if you specify a Java version we can use java again
@cairdcoinheringaahing yes
@StepHen it has always been java 1 :D
@HyperNeutrino Please do put a bounty on that, I'll get more upvotes :)
@LeakyNun update, this works fine but this doesn't
17:50
@MDXF would be good if you have a debugger
like java eclipse
Let's chill a bit with that challenge.
1- I am not going to do anything to be like Java
2- like one that dumps the stack to output?
or --display-code?
@totallyhuman Golfed
@Mr.Xcoder ok, answer mine :D
@MDXF Nah
17:51
@MDXF I mean, eclipse has a debugger for java that lets you run the code step by step
Oh
so, if you have a similar debugger for C, you should use it
So something like gdb
@BusinessCat nice
@MDXF sorry for stealing people ;_;
17:51
(Gnu DeBugger)
Visual Studio has a really good debugger
@cairdcoinheringaahing ¯\_(ツ)_/¯ you stole me too, it's a good challenge
@totallyhuman (that's adapted from my implementation in Gaia)
@MDXF the first comment on the Sandbox was "This sounds fun!".
very important
@cairdcoinheringaahing the first comment on my sandbox was "this won't work"
CMC: Given a number ≥ 2, return its prime factors that are not even. (basically return the prime factors removing 2.
@totallyhuman you forgot to set it zero for non-integer values
2 -> [], 3 -> [3], 6 -> [3], 10 -> [5]
17:53
oh
9 mins ago, by Leaky Nun
> a(n) = (Catalan(n-2) - (n/2)*Catalan(n/2 - 1) - nCatalan(floor(n/2) - 1) - (n/3)*Catalan(n/3 - 1) + nCatalan(n/4 - 1) + n*Catalan(n/6 - 1))/(2*n), where Catalan(x) = 0 for noninteger x (derived from Guy's 1958 paper).
@Mr.Xcoder CJam: {mf2-}
we're going to run out of langs that can do obscure mathematical builtins at some point
There's gotta be a much better way, but 5 bytes in Pyth: fn2TP
17:55
Longs
no the values are off
@Mr.Xcoder there's a shorter way
Also 5 bytes: f%T2P
Jelly, 4 bytes: Any HyperTraining students want to try this first?
@LeakyNun I will solve it
17:56
@HyperNeutrino For Xcoder's CMC?
@BusinessCat yes
leaky halp
@totallyhuman ?
@ATaco would be good if there's a userscript to hide deleted posts
2 mins ago, by totallyhuman
17:57
@LeakyNun (moving to language development)
is anyone working on A000131 or no?
@totallyhuman Whats? Um?
@totallyhuman what the is n%10 supposed to do
@StepHen someone above you
@StepHen Looking at it
@LeakyNun 4 bytes: -PQ2
17:58
oh shoot
aaaaa
Good enough ^^^?
@Mr.Xcoder good
I was reading the paper linked from OEIS, but it's hideous
@PeterTaylor It's "simply" a(n) = (Catalan(n-2) - (n/2)*Catalan(n/2 - 1) - nCatalan(floor(n/2) - 1) - (n/3)*Catalan(n/3 - 1) + nCatalan(n/4 - 1) + n*Catalan(n/6 - 1))/(2*n), where Catalan(x) = 0 for noninteger x (derived from Guy's 1958 paper).
@LeakyNun or just switch to Python 3
Just because there's one explicit formula given doesn't mean there's no better way of doing it
anyone else think there should be a "implement an autonomous driving system that works with unity simulation X" challenge

« first day (2365 days earlier)      last day (2771 days later) »