« first day (2232 days earlier)      last day (2906 days later) » 

07:04
Using what lang/lib?
It's a game that involves dragging cards with bits of assembler
@Qwerp-Derp ok why not
@Qwerp-Derp what lang/lib?
@betseg Probs going to use PegJS for the interpreter itself, and I might just make a website
@Qwerp-Derp 0/10 parser lib
07:11
@ASCII-only ;_; Can't be bothered with actual parser
@Qwerp-Derp but it's a simple language just use your own parser like all esolangs instead of making a really large parser
CMC: Given an int array `a` and an int `b`:
Output the first `b` numbers of the following series:
Numbers 1-len(a) of the series are just the elements of the array, e.g. `f(1)=a[1]`, `f(2)=a[2]`, etc. (This assumes 1-indexing)
Element `n` is the the sum of the last `len(a)` numbers in the sequence.
(This is a kind of extended Fibonacci thing)

Test case: [1,1,4], 7
Output: 1, 1, 4, 6, 11, 21, 38
Eeeeeh I want to mess around with PegJS
I have a challenge idea
A challenge where you dont get the amount and output the goats but reverse
@MatthewRoh ?????
you input the goats, the output is the amount
I'll make up an occasion you forgot how many goats have you counted so far
I'm wondering whom that offended
@ГригорийПерельман I would complain about not being able to type your username but I don't really mind because I can just do "@" and then enter and then boom
@JanDvorak ?????
@MatthewRoh That is A) Silly and B) A duplicate
Why a duplicate?
Link?
(btw that was just an idea)
(the one I originally planned to write is a different one)
07:19
It might take a while to find, but I guarantee there exists a challenge where you just count the number of instances of a certain string
In retina it's just goat
The last line outputs the amount of matches?
A regexp alone outputs the number of matches by default
@ГригорийПерельман will b ever be less than len(a)
07:21
Yes
It will always be at least 1 though
two lines default to replace mode
Well the one I originally planned to is 'convert Bubblewrap to BrainF*ck'
IDK what Bubblewrap is, but that seems more intresting
> Bubblewrap
I know what Bubblegum is
A BrainF*ck derivative where every character insists of O(non-popped cell) and X(popped cell)
Thats all for now
well, that's much easier than from bubblegum
07:30
@ГригорийПерельман JS, 92 bytes: f=(a,b,r=a.slice(0,b))=>b>r.length?f(a,b,r.push(r.slice(-a.length).reduce((x,y)‌​=>x+y))&&r):r
JS, 91 bytes: f=(a,b,r=a.slice(0,b))=>b>r.length?f(a,b,r.concat(r.slice(-a.length).reduce((x,‌​y)=>x+y))):r
07:48
bleet
I have changed my profile pic
wait
I have a better idea
YES!
I'm a genius
XD
What do you guys think about my new profile pic
nothing interesting about it
'nothing interesting' thats the whole concept
There's literally nothing
well, there's a gray part and a white part
(Look at my profile page)
Wait
Should I Literally make it nothing?
That's not possible. The best you can do is a transparent 1x1 image
08:02
You know the image that chrome shows when it cant load the image?
My pic was that at some point in time
@JanDvorak Yes, and that's just what I'm gonna do!
@MatthewRoh remember transparecy only works for a gravatar
@ASCII-only Well then the previous approach is the best one probs
@MatthewRoh previous approach?
@ASCII-only ^
literally capture the left side and stretch it at the size of a square
08:05
@MatthewRoh can't you just use a gravatar though
Can we use a gravatar on SE?
Woah
I applied a better one
It's a corrupted one
:)
@ASCII-only How?
@MatthewRoh you should just be able to select a gravatar from the avatar dropdown?
Gravatar isnt F*CKING sending a confirmation mail
I would like a resend, but they don't have that option
08:23
@MatthewRoh D: what
@MatthewRoh so not in spam/deleted and it sent correctly?
I think so
Or maybe I registered ages ago and gmail deleted the spam
Is my avatar updated yet?
No it isn't
Wait, am I dumb
I could literally make a temp email account
or can I
You keep using that word - literally - do you know what it means?
somewhat
Perfect
now I have a totally transparent pic
08:49
1
Q: Put some music in a box

OkxYour task is to take a sequence of letters (the music) as input (in a function or program), and print (or return) the music as it would look like in a music box. You will only receive the letters ABCDEFG.() as input, and the input will never be empty. You may also receive the letters in lowercas...

Hello guys
     11   12   13   14   15

1    11   10   9&11 9    9
2    11   11  10&12 9    8&9
3    11   12  11&13 10   8
4    13   13  12&14 12   12
5    15   15  13&15 13  11&13
Is there a correlation between those numbers?
Does transparent pics not work in chat?
or did it just not update yet
AFAIK they don't
09:05
0
Q: Encrypt String using Language of "S"

Shivam PandyaIn our language, we use language of S for basic encryption for avoid something from children if we do not wish that children know about what we are talking about. So here is how it works. Lets take "Hello there" for example. So its encryption using language of S is Hesmello Thesmer Step to ...

0
Q: Non-free languages in Cops and Robbers challenges

Martin EnderNon-free languages are not allowed to participate in Cops and Robbers challenges. And that's a good thing. If you choose an obscure non-free language, no one will be able even to attempt solving it and you get a free uncracked cop. If you choose a non-free language that is reasonably widespread, ...

0
A: Sandbox for Proposed Challenges

ZgarbCopy a single number in a list code-golf array-manipulation Introduction Suppose you want to compute the tail maxima of a list of numbers, that is, the maximum of each nonempty suffix. One way to do it is to repeatedly choose one number and replace it by a higher number occurring after it, u...

Anonymous
@Sherlock9 Hey stranger
@Riker lead (the metal) = Blei, the Pb probably comes from the latin plumbum
@Riker Haha, I don't remember who said it but I once heard something along the lines of: If you want to find out something on the internet quickly, you sould not ask but claim something about it that is not true.
Anonymous
@flawr Bill Gates said that
09:21
Apparently other people said that too: Cunningham's Law
Anonymous
That's the joke
damnit, you got me XD
Anonymous
Hook, line, and sinker
at least I just gave evidence that it actually works :D
@Mego TIL about that idiom
Anonymous
Well, not quite, because I knew the name of the law. I couldn't resist setting up the joke.
09:44
@flawr it does
0
A: Sandbox for Proposed Challenges

Shivam Pandyaking-of-the-hill In our language, we use language of S for basic encryption for avoid something from children if we do not wish that children know about what we are talking about. So here is how it works. Lets take "Hello there" for example. So its encryption using language of S is Hesmello Th...

Anonymous
09:59
1 message moved to Trash
Anonymous
Goodbye, spam
thanks
10:46
hi all
here is a potentially nice coding task. Compute the tag histogram of everyone on chat (separate for questions and answers)
not that I have any idea how to do it
@felipa tag histogram?
@ASCII-only if you take everyone currently active in chat and look at the tags of all their answers, say (the tags of the question to which they have provided answers). You can make a histogram of these tags
oh hmm
@ASCII-only does that make sense?
does it have to be just everyone on chat
10:50
@ASCII-only well one idea would be compute over a week and see if there is a time of day bias
this might be more interesting for other *.se maybe.. I am not sure
@ASCII-only but yes it is supposed to be chat focussed. Some more interesting info about the kinds of people currently in chat
i mean PPCG only has 79k answers, i'm sure SEDE can calculate it for everyone
@ASCII-only cool and then map it to the people currently active
that makes sense and would be fun
11:04
wait a second i'm too bad at sql to do this
plus also srsly we need to return a table of results for each user
srsly == seriously?
if you look only at people who are currently active it's currently 2 :)
11:24
Wow
I am here :P
ATaco is here
Hey Ataco whats up?
help anyone good at sql here?
I am too lazy to join a SE so i posted as a guest...
@ASCII-only the first task to find out who has the highest sql rep who has posted an answer recently :)
An answer btw
@DownChristopher How long do you estimate it takes to join? :)
11:35
@felipa sql rep?
@felipa Well as i have to be out of the house about 3 minutes ago too long
@ASCII-only rep for answers in sql
@DownChristopher less time than it has taken you to answer my question :)
@felipa but a good sql golfer isn't necessarily good at sql
that's for me and yes
@DownChristopher Do you have a Google account
11:37
but there is a good chance they will be good at sql I would guess
Is my avatar updated
Yes it is
but what does it mean?
What does what mean?
@betseg the avatar
hi @TuxCopter
11:46
@felipa it's supposed to be a troll. Chrome shows that image when it cant load an image
oh!
I have seen better trolls :)
why have we gone all zx spectrum with our graphics?
I have a new complicated challenge idea :)
if anyone is interested in something complicated
@Mego Belated hello
@felipa post it on sandbox?
12:04
Guys, I have a programming question for you all.
I have a calculator app on my phone named Calculator++. I think I can program with it but I'm not sure
Anonymous
If it ends with ++, it's a programming tool :P
@Sherlock9 This?
I can define numerical functions with it, and there are functions for <, >, <=, >=, but I have no loop constructs that I can find.
Can you recurse?
Yes, that app, Tux
12:07
idk but isn't ivy more like a language
recursion is a form of looping
@TuxCopter That's what I'm trying to find out
Can it test primality and add two numbers? If so, you're good to go here.
I think so, but I need a function to test recursion with before I try trial division primality testing
Fibonacci is what immediately comes to mind, but I wonder what else to try. Suggestions?
Anonymous
Just do addition by recursion
Anonymous
12:09
def add(a,b): return a if b == 0 else add(a+1,b-1)
Oh hell. I don't think functions can call themselves
Hang on
Oh
OH
I just have to define the name (create, set, edit) and then it lists itself in the list of functions!
Ok the calculator is just freaking out now
Okay for add(x, y), a valid expression would x * eq(y, 0) + gt(y, 0) * add(x+1, y-1), right?
Anonymous
I think so
either it works, or it locks up your phone
Hi, I have no (or technically extremely small and transparent) profile pic now
Can you do the same with your messages?
12:22
Uhh, do you mean the chat?
btw I am near to the 'not-hammer-but-you-can-cast-close-votes-so-its-concept-is-like-a-super-strong-f‌​ist-instead-of-a-hammer' priviledge
more like a nerf hammer than a screwdriver
You know, you can hammer nails with screwdrivers (or can you?), but its very hard
changed to super strong fist
I mean super strong fist = less strong hammer
but super strong fist is more 'awesome-ish'
@JanDvorak No, it's just saying invalid expression near the gt part
Not sure why
I tried fib(x) with x*lt(x, 2)+ge(x, 2)*(fib(-2+x)+fib(-1+x)) and it doesn't have a validity error but the results are weird
x  fib(x)
0  0
1  1
2  1
3  -3
4  -4
5  4
6  11
7  16
8  20
9  24
10 28
11 32
12 36
12:44
Alright, I'm starting to think that the answer is no here
I'm tempted to write a calculator app for Android
I've needed to learn Android anyway. The trouble is that I have neither the patience nor the temperance for updating and maintaining that app
What app?
We've been discussing this app, Calculator++: play.google.com/store/apps/…
I'm thinking of writing a similar calculator app that allows recursion somehow
Or a loop construct at least
Is that the one you meant with "updating and maintaining"? Kinda confused now.
@Sherlock9 looks better than I thought it would
@Geobits I said, I'm tempted to write my own app. I just don't want to update and maintain that app if I release it to the store
Does that explain things?
12:58
Oh. Well maintaining something like that shouldn't be too bad. Updates are a different story, but you can do those as little or as often as you like.
1
Q: Bleeeet Bleeeet Bl Bleet!

Matthew Roh(Meaning: Convert English to Bleet) We have praised goats as god for years now. But if we can't translate English to 'Bleet', the Goat God's language, We cannot communicate with them. So, to communicate with them, we have researched the activities of goats, and retrieved this pattern, which is...

@Sherlock9 Yeah. I thought you meant updating and maintaining Android Studio or something.
Ah. Weird.
I'll think about it while I go get my dinner
See you guys later
13:22
@Sherlock9 That's a nifty sequence ...
@Sherlock9 The docs for Android is very detailed
It's amazing. Android is amazing. Android Studio 2.3 is amazing (from what I've heard)
14:06
@flawr hm okay, yeah I knew where PB was from just wondered if german had something like plumbum
@NewMainPosts damnit @LegionMammal978 why have you infected him
0
A: Sandbox for Proposed Challenges

HyperNeutrinoFind a basis for each eigenspace! Related The challenge is just as it seems; you are to find a basis for each eigenspace of a matrix. If you have taken Linear Algebra 1, you'll understand what this means, but this is an attempted full explanation of eigenvalues, eigenvectors, eigenspaces, what ...

@Downgoat finally got around to building + testing gitgoat, 10/10 very nice UI
something to consider also: maybe show the license ("LICENSE") and possibly other .md files next to the readme on the main page of the repo?
14:24
I have a coding question... say I have a list of tuples like [(3, 0, 2), (0, 1, 1), (0, 3, 0), (1, 3, 2), (3, 0, 3), (1, 0, 0), (1, 3, 1), (1, 0, 1), (3, 2, 1), (1, 3, 0), (2, 0, 3), (0, 2, 1), (2, 2, 0), (1, 1, 1), (0, 3, 1), (3, 3, 3) ...
let's give two tuples x and y the same label if y <= x= < 2*x.
user165474
@Lembik Just any list of tuples, or specifically size-3 tuples? And I presume this is Python?
how can I count how many distinct labels there are?
@HyperNeutrino they will be k-tuples for some k. It's k here as an example
user165474
So wait, x is the first value in the tuple and y is the second, right?
user165474
@Lembik Oh, okay.
Example x = (3, 0, 2) and y = (0, 1, 1)
those won't get the same label
user165474
14:26
Oh okay. So how are tuples compared?
user165474
And I presume multiplication by a number is just scalar multiplication, right?
yes scalar
you compare them by seeing if y <= x<= 2*x.
which in this case isn't true
user165474
No, like how do the inequality operators work on tuples? I think it compares each value and when two of them are unequal, it returns the result; otherwise, they are equal. But I'm not sure. This is Python right?
oh elementwise
user165474
Oh okay.
14:28
this is a python list but really I can translate an algorithm into python
user165474
So pretty much they have the same label if the second tuple is not larger than the first tuple, and the first tuple is not negative?
no
(6,6,6) and (1,1,1) will never have the same label
user165474
Why not? (1,1,1) <= (6,6,6), and (6,6,6) < (12,12,12)
argh! Typo by me sorry
user165474
Oh wait, did you mean 2*y?
14:29
y <= x<= 2*y
yes!
user165474
oh lol
(shame faced emoji)
@Riker yeah I had same idea. Maybe even showing contributing.md too
@HyperNeutrino does it make sense now?
user165474
@Lembik Yes, it does. I'm working on a potential loophole I found.
user165474
14:36
And if it's not a loophole then this task becomes trivial.
ah ok
user165474
(2,2,2) and (1,1,1) have the same label.
user165474
(4,4,4) and (2,2,2) have the same label
user165474
But (4,4,4) and (1,1,1) don't have the same label?
right
(2,1,2) and (1,1,1) also have the same label
user165474
14:40
So wait, if (2,2,2) and (1,1,1) have the same label and (4,4,4) and (2,2,2) have the same label, then (4,4,4), (2,2,2) and (1,1,1) should all have the same label. But (4,4,4) and (1,1,1) don't have the same label...
argh :)
user165474
yeah... :) it's not as simple as I originally thought.
ok so I phrased it badly again.. we want to assign as many labels as possible according to the rule
so in your case we can give (1,1,1) one label and (4,4,4) another one
but (2,2,2) is going to get either of those two
let me think of a better way to make this formal
it's the maximum number of tuples which are not equivalent to any other
where equivalence is defined according to the y <= x<= 2*y rule
if it is clear at any point I would appreciate help with the wording!
How about..consider two such arrays of Hamming distances. Say x = (0, 2, 2, 3, 0) and y = (2, 1, 4, 4, 2) as examples. We say that x and y have are "close" if y <= x <= 2*y where the scalar multiplication and inequality are taken elementwise.
we want to count the number of tuples which not close to any others
is that better?
user165474
@Lembik Okay, so essentially we want to figure out how many tuples do not have the same label as any other tuples?
Google.com displays correctly on IE 4 o_O
14:48
@HyperNeutrino yes... although I screwed up the definition of label
user165474
Okay. So that makes more sense.
@TuxCopter I am impressed you are running !
great!
@TuxCopter That's not terribly surprising. Google has a pretty simplistic homepage because they want it to load fast, so I imagine that would work pretty well for backwards compatibility.
what about lynx?
or dillo
I would bet it loads just fine in Lynx
Probably loads just fine in Links, too
14:51
dillo.org development seems to have slowed :(
Well, Google is pretty much the only webpage IE 4 can display
@Lembik to be fair he is 50% helicopter so kinda unfair
That project name is easy to misread if you have a dirty mind...
@JanDvorak dill? As in the spice
@JanDvorak too late
14:52
Jello?
@Lembik I installed Windows 2K on a VM and it's the only IE version that works on it I think
@TuxCopter wow :)
@Downgoat Length of "Tux" vs. length of "Copter" would imply he's 2/3rd helicopter.
what did windows 3.1 have?
netscape?
Mosaic, likely.
14:53
ah yes.. netscape was too fancy :)
@Lembik Win3.1 didn't even have a builtin browser
Win95 was the first Windows version to have a builtin internet browser IIRC
Yes, that was IE
Opera 3.62 runs on windows 3.1 apparently!
@Downgoat oh true, yeah
and I havne't used github enough but there's got to be a couple other good ones to include
maybe INSTALL.md/txt?
genuine Win3.1, or emulated inside a browser?
14:56
@TuxCopter Nope, apparently not built-in.
> It was installed as part of the Internet Jumpstart Kit in Microsoft Plus! for Windows 95 and Plus!.
Internet Explorer 5.01, netscape 4 and opera 3.62 is the story
Then it's Win98 the first to have a builtin browser
@JanDvorak I am just reading superuser.com/questions/423061/…
Do anyone here know how to change the DNS sever on Windows 2000?
I bet the default DNS is outdated by 2 decades
user165474
@Lembik For sure not the shortest, but here: f=lambda k:len(k) - len([x for x in k if len(filter(lambda l: x <= l <= tuple(2 * k for k in x) or l <= x <= tuple(2 * j for j in l), k)) > 1])
15:00
@HyperNeutrino interesting!
I might pose a challenge around this
@TuxCopter I think there have only been one or two root changes in that time, so it's likely OK
Literally no page load
user165474
@Lembik Pretty straightforward solution, but yeah, I'd be interested to see a challenge about this!
15:01
Root servers tend to be pretty static
Can you do an nslookup?
Oh wait it does lookup correctly
No idea why IE says the page can't be accessed
What's the page?
Wikipedia
@HyperNeutrino so the challenge, if I can write it, will be a little like codegolf.stackexchange.com/questions/54354/…
That runs off of https, and the browser likely doesn't have the new TLS versions.
15:04
Makes sense
user165474
@Lembik Hm. That's an interesting challenge. That would be an interesting challenge.
15:19
if you could make some answers for n = 1,2,3,4 that would be really great
user165474
Oh, nice challenge! Sorry, I'm occupied right now, but I'll get to that if I have time later.
cool
0
A: Sandbox for Proposed Challenges

LembikLet P be a binary string of length n and T be a binary string of length 2n-1. We can compute the n Hamming distances between P and every n-length substring of T and put them into an array (or list). Now let's consider two such arrays of Hamming distances. Say x = (0, 2, 2, 3, 0) and y = (2, 1, ...

15:41
Dangit. I hate it when I come across something neat, go "Oh, that'd be a good challenge," go search for it, and see that it was asked like 4 years ago.
@AdmBorkBork reinventing the wheel is fine, as long as its round
Yeah, but even I would dupe-hammer it closed, and I'm (in general) more on the lenient side when it comes to dupes.
this is the challenge, for what it's worth.
very nice

« first day (2232 days earlier)      last day (2906 days later) »