« first day (1699 days earlier)      last day (3138 days later) » 

9:00 PM
Good afternoon, world!
 
Ditto
 
@BetaDecay "!thgindooG">:#,_@
 
::print("Good night!");
 
public class BB{public static void main(String[]a){System.out.println("Good Night everyone!");}}
 
print"Goodnight!"
 
9:05 PM
'Goodnight!'
 
Dangit Golfscript.
 
Is there a language even more verbose than Java?
 
INTERCAL
 
Assembly
 
Ok, my next codegolf challenge will be intercal only^^
bb everyone
 
9:08 PM
Good
 
(337343635537761436988449).to_bytes(10,'big').decode()
 
Applescript beats INTERCAL.
tell application  "Microsoft Word"
    open file "Diplomarbeit" of folder "Dokumente" of disk "Studium"
end tell
 
Applescript is actually not that bad
 
Is there such thing as inverse code golf
 
Yes
 
9:14 PM
Where the goal is to get the most bytes?
 
can anyone who knows ><> tell me why this prints Good night! and then an error?
Oh wait I'm stupid nvm
 
Oh wait I'm stupid nvm should be a button on SO questions. :)
 
I would post my Good night in ><> answer but chat seems to eat the whitespaces
Alright so I'm gonna write this challenge really quick and then ask you guys what you think
You're my focus group
Except you don't get paid
Any way to do LaTeX on SE?
 
AFAIK no. But you can use codecogs and include the image.
 
9:21 PM
Thought making a Befunge answer vertical would save bytes. Nope. Newlines.
 
Alright
Focus group are you ready?
 
@quartata A few SE sites have the ability. Math.SE being an obvious one.
You can also do LaTeX in chat if you have the ChatJax extension.
 
Hmm
Oh well it doesn't matter
Here's the challenge
Let x be a number of arbitrary base such that D is the set of its digits. x is a ***Can't think of a name Number*** if for any number n between 1 and the length of the number, D_(n+1) = D_n + D_n-1 + ... + D_1 + n. So for example, let's take the number 349 in base 10. If we label the indices for this number, we have:

1 2 3

3 4 9

Starting from the first digit, we have 3 + 1 = 4. Then with the second digit we have 3 + 4 + 2 = 9. So this number is a Can't think of a name Number.

Here's the challenge. Given a base between 1 and 62, calculate all the Can't think of a name Numbers for that ba
Tell me whatcha think
 
Can you put it in the Sandbox? Chat is not a place for posting a question
 
Oh sorry
I did it before and I didn't get yelled at so I thought it was OK :P
My bad
 
9:31 PM
Works. Just use [upload...] -> [from the web] -> http://latex.codecogs.com/gif.latex?<putlatexhere>
 
^ or use a direct link
(pro tip: use a ! at the beginning of a message to force image oneboxing)
 
Does this look familiar to anyone: b'I\x1fD\xb4\xf5\x91\x1fA\xbd\xb3`f\x86\xc2\x88\x91JP\x8c\xcf\xac\x88\xfa\x1d&'
 
I posted it on the sandbox zach
 
Sorry about that again :P
oops forgot a number
 
9:45 PM
I think you should come up with something else to call the "Can't think of a name Numbers" @quartata
 
Yeah that's just temporary
Hmmmm
I would call them Quartata Numbers but that's a little egotistical
 
Just pick a random work from the dictionary.
 
Confidant Numbers it is then
Little strange but ok
 
Your secrets are safe with these numbers.
2
 
9:50 PM
I'm a little worried people will be confused cause the indexing starts at 1 but it doesn't really work otherwise
or at least it's not as cool
 
> [...] if for any number n between 1 and the length of the number, D_(n+1) = D_n + D_n-1 + ... + D_1 + n.
That doesn't make much sense @quartata
 
What part doesn't make sense?
 
The part I quoted
The formula after the comma ^
 
Well basically it's saying the sum of the previous digits plus the index of the current digit is equal to the next digit
so with the 349 example
let's take the 4 digit
4 + 3 + the index 2
 
Ok I got it now
 
9:54 PM
gives us the next digit 9
It's in set notation which was probably not the best way to explain it :P
It would be nicer if I did it up in LaTeX
One second actually
 
0
A: Sandbox for Proposed Challenges

quartataConfidant Numbers Let x be a number of arbitrary base such that D is the set of its digits. x is a Confidant Number if for any number n between 1 and the length of the number, D_(n+1) = D_n + D_n-1 + ... + D_1 + n. So for example, let's take the number 349 in base 10. If we label the indices for...

 
Now with latex
Didn't want to do the whole thing up cause it wouldn't stay in line
 
Max
should be: D(n+1)=D(n) + ... + D(1) + n
 
but that equation I latexed so it's understandable
?
It's not a function it's a set
 
Max
or with square brackets
 
9:58 PM
Oh I see what you mean
Yeah didn't mean to have the -1 out there
It's better now with the picture
Well I got an upvote so that means someone liked it
I figured it was an interesting enough challenge I was just worried that it wasn't explained properly
Does it make sense?
 
Max
yeah with the picture it's more clear
 
It makes sense to me, but then again, I'm a mathematician. I also immediately figured out how to generate the numbers. :P
 
Heh
 
Max
also I should change "any number n between 1 and the length of the number," with "any given n between 1 and the length of the number,"
 
Alright
Ill fix that and then post it
0
Q: Confidant Numbers

quartataConfidant Numbers Let x be a number of arbitrary base such that D is the set of its digits. x is a Confidant Number if for any given n between 1 and the length of the number, So for example, let's take the number 349 in base 10. If we label the indices for this number, we have: 1 2 3 3 4 ...

Have fun!
 
10:05 PM
1
Q: Confidant Numbers

quartataConfidant Numbers Let x be a number of arbitrary base such that D is the set of its digits. x is a Confidant Number if for any given n between 1 and the length of the number, So for example, let's take the number 349 in base 10. If we label the indices for this number, we have: 1 2 3 3 4 ...

 
I just passed off my CS lab, but for some reason, the pass-off computer didn't have boost (but it should...) so I zipped boost with my lab.
The zip file was 16 MB.
Someone else passed off their lab, at 4 KB.
 
CS labs are notorious for not having stuff
I went to my CS lab once and it had Java 8 and yet it had a version of ant that was 7 years old
 
@quartata But it's weird, since when I ssh into the lab, it has boost. That's why I thought I could use boost.
@quartata Wow.
It was pretty funny, though. The TA was surprised. He didn't expect anyone in this class to know Boost, Git, SSH, unit testing, etc.
 
I just edited your question. Feel free to revert any edits. @quartata
 
I used all of the above.
 
10:13 PM
Sorry I'm back
OK thanks Zach
You made a mistake with the equation
It's D(1) + n
 
I fixed it
It should be g(n+1) = f(n) + g(n) + f(n+1), where f denotes the index, and g denotes the digit at an index.
Your use of D makes no sense, because of your prior definition of it.
 
Uhh
That's the idea though...
You add the index only once
You take each of the previous digits + the index
and that makes the next one
Sorry if I didn't make that clear initially
 
No, I understand how the equation works
You said
> D is the set of its digits
 
Yes
 
Thereby making this equation
> D(n+1) = D(n) + D(n-1) + ... + D(1) + n
Reading where D is the set of its digits
 
10:22 PM
Yes....
 
The set of digits of n+1 equals: the set of digits of n, plus the set of digits of n-1, plus the set of digits of 1, plus n.
 
..?
No the way I had it should have meant the N+1 element in set D
Other than that all the other edits you made are great, thanks for that
I'm not great with formatting
 
If you applied what you wrote on the second index of 349, you would get 3=2+1+1+2
I'm going to edit your Sandboxed version to see if I can make what I'm saying more clear
I'll leave your main post alone
 
Does anyone have any opinions on this? I think I might post it soon.
 
OK I think I see what you are confused about
Two things.
One when I say D_n+D_n-1+...D_1 I'm essentially saying sum all the elements in D between 1 and n
that's what the ... is for
Secondly, D is not a function. D is a set (or an array in CS) that contains the digits of X, which is the number we are testing
 
You aren't using D correctly then.
 
How, exactly?
 
Did you look at my Sandboxed edit?
 
@NewMainPosts FOR ONCE I have the first answer! :D
 
10:43 PM
@quartata I added two full verbose examples of the equation I added
 
Yes I did
 
You have your description and equation mixed up
 
As far as I understand it, that appears to be index + digit + index + digit
this is digit + digit +... +digit + index
here maybe if I put it in psuedocode it'll be better
 
I know what your intent was with the equation, but your description does not reflect the equation.
 
So let's say we start with n=3
Then I don't understand what the confusion is here.
 
10:46 PM
The part where you said 1 + 3 = 4, for example.
According to your equation, it's actually 1 + 3 + 0, which is reflected in my rewritten equation. Either your description is wrong, or your equation is wrong.
 
No it's not. My equation says sum the digits between 1 and n and then add the last index to it
if n=1 then that is 3 (first digit) + 1 (index)
 
The sum of digits between 1 and 20 is equal to 100..
 
Sum of the digits of x
the number
 
But you just said
> sum the digits between 1 and n
 
> The key insight here is that given a sequence x (like, say, [1,2,5]), you can get the next term in the sequence with sum(x)+len(x), which gives 11 in this case (B).
 
10:50 PM
So if the input was 20, the sum would be 100
 
That's how I interpreted it.
 
That was a typo
 
That's not summing the digits, it's summing the integers.
[...] + 10 + 11 + 12
That's what you meant, correct?
 
Are you thinking all numbers are in decimal?
 
Because the say it's written, it means [...] + 1 + 0 + 1 + 1 + 1 + 2
 
10:52 PM
I meant summing the digits of the number
Here I'll write you a program that tells whether or not a number is confidant
 
@ZachGates Ah, actually, you would write [...] + A + B + C. Then A,B,C are digits.
 
Let's take this discussion here. @quartata
 
11:23 PM
@AlexA. I've been trying to get ElementaryOS to dual-boot, but it's not happy.
I ran into a problem where it just freezes on the loading screen.
By some miracle, Windows still works.
I'm gonna try to ask a question at elementaryos.se
 
Zach -[>+<]>--.[--->+<]>--.+++..+++++++.-[---->+<]>++.[->+++<]>++.[--->+<]>----..[->+++++<]>+++‌​.
That came out weird
Apology BF program
 
Lolz. ---x--- => x.
 
Yeah not sure how that happened
 
Hey, asterisk!
*
 
> Sorry, bro.
Haha, no problem @quartata
 
11:33 PM
Didn't output the comma did it?
I might have made a mistake LOL
It was supposed to just be Sorry bro.
I appreciate the other edits you made at any rate
Now it looks so pretty
 
The comma is correct grammar
 
I know but I didn't program the comma in by accident so if it showed up that was a double accident
 
Ah, ok
It's 200 bytes now; it was 201 before. @El'endiaStarman
 
Wait no, 203 now, 204 before.
whoops
No, forgot to take out one line that did nothing useful in my saved program.
@ZachGates No, it's definitely 199 bytes. Did you forget to take out the trailing newline?
 
I got 200 bytes. @El'endiaStarman mothereff.in/byte-counter
What are you using to count bytes? (just wondering)
 
11:49 PM
@ZachGates len(""" ... """).
I get 199 that way. I also get 200 with your linked online byte counter.
 
It's because in Python, the "\n" is interpreted as a single character. @El'endiaStarman
 
AH! Yes, exactly.
 
You know, you could just use wc. :P
 
So...should I use 199? \n does count as a single byte...
 
11:51 PM
Yeah that's what I do
wc
 
You guys using Linux or something?
 
Use "<s>201</s> 200" @El'endiaStarman
 
Yes..?
 
I'm on Mac
 
Windows here, using IDLE. No wc for me.
 
11:52 PM
Then you can use wc too
If you are on Mac
wc -c FILE
 
Ok, let me restate that: You know, you could just use wc if you're on a sane OS. :P
 
Hey, I like Windows 10.
 
@El'endiaStarman It counts as two bytes because it saves as plain text. Not an actual newline. Otherwise, your program wouldn't run.
 
@Doorknob Burnt
 
The OS wars have begun!
 
11:53 PM
@ZachGates Alright, that's reasonable. I'll do that.
 
Dundundundundundun
 
(Surely Windows has some method of counting characters?)
 
@Doorknob (I know, right?)
 
Probably. But again, I'm already working in IDLE. It's quicker to just do len("""...""") than it is to open up a command prompt, navigate to the right directory, and execute the command.
 
11:54 PM
I just pinged myself that was weird
 
No, Windows doesn't have stuff like that.
 
@El'endiaStarman I guess. I have that site bookmarked right next to PPCG, though :P
 
I paste the program into a new file in my text editor and see what the file size is.
 
I just count chars from within my editor (vim).
:%!wc
or if I only want to count chars on a single line, :.!wc
or if I want to count certain lines, use a Visual selection and :!wc
and this is one of the many reasons why vim is awesome
 
I just look at the screen because the amount of chars is already displayed on it.
 
11:56 PM
Notepad++ displays characters, I think (along the bottom?)
 
Oh yeah, vim shows the number of bytes characters when you save a file... not sure why I haven't realized that yet
 
That's why it's generally better to use a site like that. @El'endiaStarman
len(""" ... """) would return 1 (it's actually 3)
 
@ZachGates Notepad++ uses Scintilla's own char count.
 
>>> len(bytes('щад', 'utf-8'))
3
 
There aren't any \r's coming from a string literal though.
 

« first day (1699 days earlier)      last day (3138 days later) »