« first day (2110 days earlier)      last day (2739 days later) » 

6:00 PM
What's 1 game when you already have 570 :P
 
Don't count the ones you never play. Now what's your tally? :P
 
Plz, how do I make nuke sound play on badly written website? Audio element no work. crazypython.github.io/whowontheelection/trump.html
 
@noɥʇʎPʎzɐɹC pls
 
Er, nowadays like 3 :P
 
1
Q: Over, under, over, under

OliverYour task is to print this exact text: \\\\////\\\\////\\\\////\\\\////\\\\////\\\\//// \\\\// \\//// \\//// \\//// \\//// \\//// \\\\ //// //// //// //// ////\ //\\\\ ////\\ ////\\ ////\\ ////\\ ////\\\ ////\\\\////\\\\////\\\\////\\\\////\\\\////\\\\ /// \\\\// ...

 
6:03 PM
also, I highly recommend Democracy (as well as all of Positech's games) (brain needed, though)
 
Rocket League, GWYF and then a rotation of CSGO/WAW usually
But now I can only play against bots, the home connection isn't reliable enough to play anything online :/
 
I dunno about Democracy, that one didn't last me very long :/
 
Anonymous
@NathanMerrill I'm fresh out of those; where can I get a new one?
 
(on the other hand though, every Zachtronics game)
 
@Shebang I'd play rocket league with you sometime. It's one of my favorites but I don't have anyone to play with
 
6:04 PM
@Sp3000 they do have a steep learning curve, but I enjoy them
 
@Webdevs, how to make autoplay in bakcground sound element?
 
@DrMcMoylex Most of my friends have stopped playing as well! Be warned, I only have practice playing Hoops ;)
 
Lol, I can't stand hoops. I Much prefer soccar
 
@betseg How do you find `n` when `
((10^n-1)/9)%a==0` and there are so many values for `n`?
 
Minimal n, I believe
 
6:07 PM
Oh, so (10^n-1)/9 = a if n is minimal?
 
@KritixiLithos You could always try continually multiplying the big number until you get something with all ones, I assume that would probably take just as long though (I'm not sure of the efficiency of multiplication over exponentiation computationally)
 
Not equals a, is divisible by
 
So, n is the big number that is all ones
 
a is the big number
n is the number of ones in what will eventually be the bigger number
 
Herlo, this is the last day of all life as we know it.
 
6:09 PM
Bn is the big number that's all ones, n is the number of digits of Bn
 
But isn't Bn actually B^n ?
 
No
Bn = (10^n-1)/9
Bn % a == 0
 
(I think you're meant to think of n in Bn as a subscript)
 
Here, @ school, only betseg, nathan, and mego have unblocked avatars.
 
@Sp3000 exactly
 
6:11 PM
@noɥʇʎPʎzɐɹC gravitar is unblocked then
 
That makes sense then
 
My avatar is at googleusercontent.com
 
Even if/when you do find this magical n, you still have to figure out how to efficiently factor 2^n - 1
 
Yeah... that's the actual hard part :/
 
But Bn is a decimal
 
6:14 PM
Can you factor in linear or close to linear time?
 
@Shebang wait, is it 10^n or 2^n?
 
Bn is an integer because 10^n - 1 is always divisible by 9 for n > 0
 
Hi NSA, hi turkish gov't.
 
@arda Bn = (10^n - 1) / 9, b = 2^n - 1
As far as I remember
 
Is it 10^(n-1) or (10^n) -1
 
6:15 PM
The second
i.e. Giving you a bunch of 9s, so division by 9 gives you a bunch of ones
 
TNB is def. a threat to national security.
 
And I'm pretty sure you can't factor near linear time, no matter if you're talking about bits of actual values
... yet anyway
 
How is that 'general' prime factorization algorithm characterized then?
The one where you divide by 2 until you can't, then 3 until you can't, etc. until you are left with a value of 1 and a list of the things you divided by
 
@noɥʇʎPʎzɐɹC no turkish go- CRAP I FORGOT TO INSTALL OPENVPN ON WINDOWS
 
Oh, I see what you mean now, scratch that last statement
 
6:18 PM
Would that be near-linear?
 
4
Q: Build me a Brick Wall!

dylanI need help building a brick wall! Throw together some code for me using no input and produce the following output wall shown below: _|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___| ___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__ _|___|___|___|___|___...

 
Hello people. Can anyone think of a better name for this matrix?
 
I mean, even if it is it's still a number with too many digits to do it in a reasonable time anyways
 
That would be sqrt(n) by actual value, but exponential by bits? I think
 
@NewMainPosts The irony, now with the US presidential elections xD
 
6:20 PM
@NewMainPosts matches with the date
 
@Zgarb I think the explanation could do with the word "antidiagonal" somewhere, to characterise visually then x+y condition. As for names... "density" sounds good, but I'm not sure what to prefix it with
 
@Sp3000 The x+y condition is not really needed, only that other entries of M[x,y] than (x,y) have been determined. Maybe I'll change that and try to make it clearer too.
 
Zgarb, I was interested in this challenge so I whipped something up to try and follow the logic. How did you visualize your 800x800 image if I might ask?
 
@Shebang Just Python and PIL.
 
Ah, alright. I like the challenge! :)
 
6:31 PM
@Sp3000 Edited.
@Shebang Thanks!
 
By 'any reasonable format' would printing a 'raw' list of lists be sufficient or would you like something closer to the 20x20 example you gave?
 
List of lists is fine.
 
@Zgarb The "On the other hand" sentence could be reworded to say if it's a 0 then it'll be 2/12, otherwise if it's a 1 then it'll be 3/12, but otherwise the first paragraph is certainly clearer now
 
going to post my first pcg answer
 
6:36 PM
@Sp3000 Thanks, clarified.
 
CMC: given a squarefree number N, output the index of N in the squarefree number sequence (A005117)
 
codegolf.stackexchange.com/a/99043/49280 - I'm thinking of a new approach so this isn't fully final.
 
It doesn't seem to print what's expected :/
 
@ConorO'Brien What does CMC mean?
 
"Chat mini challenge"
 
6:42 PM
@Shebang it does so, at least on csharppad.com
 
OK, I thought it meant "Criticize my challenge"
 
On C# pad it only prints 5 lines
 
ooh, 10 lines, my bad
 
And every other line should start with 3 _, not 2
 
CMC: given a squared fibonacci number find its sequence number
 
6:46 PM
@DmitryKudriavtsev sequence number = index?
 
@DmitryKudriavtsev actually, 2 bytes: √f Try it online!
 
Python, 43 Bytes: f=lambda n,a=0,b=1:n**.5>a and 1+f(n,b,a+b)
 
@ConorO'Brien Of course a golflang beats everything
fml
 
6:49 PM
@DmitryKudriavtsev solution is to become goat
 
@ConorO'Brien have i mentioned that I hate golflangs?
@Downgoat gaot**
 
I figured you might have ;)
 
@ConorO'Brien It's actually 2 bytes o_O
 
indeed
 
Seriously, Actually have more ridiculous builtins than Jelly
 
6:50 PM
does anyone here know rails, materialize css, and slim templating language?
 
@DmitryKudriavtsev No sorry I don't take the train
 
0
Q: Strange alignment issues with Rails and Materialize CSS icons

Dmitry KudriavtsevI am having a very strange issue using Materialize CSS's icons in a table. They do not seem to align properly. Screenshot: (All personal details blurred out.) Here is my Slim template: .container h1 | View Users = form_for :user, url: "/users" do |f| table tr t...

 
@TuxCopter Wait, are you saying Seriously does or Actually? Or both ;)
 
@TuxCopter bahaha
 
@Yodle Probably both ;)
 
6:51 PM
@Yodle actually, they seriously might have them
 
@TuxCopter :') you changed your avatar :DDDdDdDDDDD
 
@El'endiaStarman ^^
 
> With great power comes great electric bill
5
Lol
 
6:54 PM
@ConorO'Brien Is there an answer in Seriously?
 
seriously is actually
 
Do I ask here if a question has been posed ppcg yet?
 
Oh wait I didnt know that
 
@Fatalize ;_;
 
@GabrielBenamy use the sandbox
224
Q: Sandbox for Proposed Challenges

SandboxWhat is the Sandbox? This "Sandbox" is a place where Programming Puzzles & Code Golf (PPCG) users can get feedback on prospective challenges they wish to post to the main page. This is useful because writing a clear and fully specified challenge on the first try can be difficult. There is a much...

 
6:55 PM
thank you
 
@GabrielBenamy sure, you can ask here. We generally like people to post stuff in the sandbox, as there you will get more than just dup-checking
 
@GabrielBenamy sure, you can, but sandbox is better place as Conor said
 
wait nvm what I said
 
@Downgoat :D
 
._______. Double ninja
 
6:56 PM
if it's mere dupe checking then asking here is a good idea
 
When we get that updated site design on January 1st is it possible to have a sandbox link next to the post question link?
 
don't post a question asking for dupeness
@Shebang November 1st
 
There was a slight delay ;)
 
Of 2042
 
I found 9*a, which is 8764995592184829582976208833008700108320518300165092801758243511471338936543570‌​826847257781813
 
6:57 PM
@TuxCopter I think they are waiting for year to overflow until it reaches November 1, -2016
 
I tried looking, but I couldn't find a question about lowest-cost maze traversal
 
@Downgoat This will statistically never happen because bit widths increase exponentially ;_____;
 
@KritixiLithos Er, what significance does it have?
You need to find some k such that k*a = (10^n - 1)/9 for some n.
 
So k*(the big number I found) = (10^n - 1)
 
Essentially yes.
 
7:00 PM
0
Q: What are some functions that golfing languages tend NOT to have, or do worse than conventional languages?

tuskiomiI'd like to write challenges that encourage people away from golf languages, and into a more competitive space. what are some things that golf languages tend to not do, or do not as well compared to non golf languages? For all intents and purposes, we'll consider a language a golf language if it...

 
Now to find n...
 
You really want to find k ;)
 
But there are 2 variables in a single statement
 
If you have it so that k*bignum is a number only containing 9 then you have n :)
Because 10^n - 1 will only have 9s in it, you can calculate n from k.
I may be wrong but I believe that k must also be of the form k = 10s + 3 for some s > 0
 
So, brute force to find k
 
7:03 PM
Not ideally but yes :P
 
n = log(k*bignumber + 1)
 
Yep!
So solve for k ;)
You may want to consult one of the more knowledgeable mathematicians in here when they are around rather than me ;)
 
I'll ask my math teacher tomorrow
G'night, then!
 
k * [big number] + 1 = 10^n, correct?
 
@EᴀsᴛᴇʀʟʏIʀᴋ reddit.com/r/Owls
 
7:08 PM
@GabrielBenamy Yep!
 
@NathanMerrill you're too late:)
 
isn't k just the repeating portion of 1 / [big number]?
 
@flawr ? somebody else posted that video?
what?
 
@GabrielBenamy If that's the case that would be pretty cool! Any way of proving that
?
 
@NathanMerrill I messaged it to Mr. Starman a while ago :)
 
7:10 PM
we must seriously have the same recommended videos. It only has 40K views
 
The only progress I have made is finding out that 14681639597968049123 * bignum = 12868450636223620404423462872576667316344390130807974747954384356861541395066622‌​9864371486910549999999999999999999, so this k is going to be massive
 
maybe youtube's neural net has a "PPCG likes these", and has hooked our users together
 
@NathanMerrill I've got it in my subscriptions. (I usually skip teh "recommended" section=)
 
@flawr still, crazy
 
@NathanMerrill Next time I'll notify you too:)
 
7:13 PM
@Shebang consider the case when [num] = 7: then k * 7 + 1 = 10^n
the period of 1/7 is 142857, and 142857 * 7 = 999999
 
@NathanMerrill Did you already watch this guy's other videos? He's a genious in communication/visualization!
 
Granted, 1/[big num] has the potential for a monstrously large period
 
@NathanMerrill what are you doing with your life then? :D
 
7:14 PM
oh, I posted a comment on that video, but perhaps you know the answer: you know how they drew a shape using the height of the two points?
the problem is that the midpoint isn't unique two any two points
a midpoint can correspond with lots of pairs of points
so the height at a given midpoint doesn't really make sense
 
bounded by the product of (one less than each of [big num]'s prime factors other than 2 and 5)
 
@Sp3000 Interesting.. I have made a bit more progress!
 
@NathanMerrill It is not just one surface!
 
k is definitely larger than 3944411088923515356522441677405450622014132389363853537119303898313906947664681‌​639597968049123
 
sorry, my mistake
the number of digits is bounded by that
 
7:19 PM
@NathanMerrill Also: There consider some "midpoint", then try to imagine how many other pairs of points have the exact same midpoint.
 
I think I am going to find it in a second
 
There are not "too many"
 
that's not true. If you have a oval, there are infinite points at the center
all with unique heights
 
strictly speaking
 
Right, but for all other points you only have finitely many=)
 
7:21 PM
k = 10^[big number] - 1
is a valid solution
 
maybe. If you have a rounded square, then you have infinitely many points with infinitely many heights
 
But just keep in mind that the "surface" shown over the curve is not just one surface.
 
(each of the sides)
 
sorry, [big number - 1]
 
k is getting so long I can't post it here ;P
 
7:22 PM
although, I'm not sure if "rounded square" is considered continuous
 
@NathanMerrill it is, you can even consider a regular square!
 
ah ok :P
 
You just can't make any "jumps"
Just remember that this representation is not a single surface.
 
wolfram alpha breaks trying to compute anything about it
 
@flawr if its not a single surface, then the process of "map the torus onto the surface" doesn't make sense
 
7:24 PM
It's almost working for me
I can get thousands of digits of 9s for my k
but not the first 94 :/
 
... if you're still brute forcing, you should probably stop :P
 
I'm not ;P
(k * 87649955921848295829762588330387041083215183061656928017582435114713389365435708‌​26847257781813) mod 10^4000 = 10^4000 - 1
 
@NathanMerrill Yes it does=) Consider a parametrization of the curve i.e. a continuous bijection f : [0,1]-> curve
 
Calculating n is easy
 
Any reason this won't be able to get the first 94 digits to be 9, but everything after it works?
 
7:25 PM
n = 87649955921848295829762588330387041083215183061656928017582435114713389365435708‌​‌​26847257781812
calculating k takes forever because 10^n is ludicrously big
 
then can identify a pair of points on the curve with a point on [0,1) x [0,1), and on that square you really have a single surface.
 
Hmm I have a different n there
 
So, ((10^876...812-1)/9)%a=0? Is it the question I asked?
 
k is the repeating portion of the following integer:

((10^87649955921848295829762588330387041083215183061656928017582435114713389365435708‌​26847257781812) - 1)/87649955921848295829762588330387041083215183061656928017582435114713389365435708‌​26847257781813
 
@flawr I'm not sure I follow. My understanding though, is if there are two surfaces, then there must be some break between the two surfaces, which means that you'd have to cut up a torus to map onto it
 
7:29 PM
We know that every number coprime to 2 and 5 has some product in base 10 that is comprised solely of 9s
 
Yeah Gab I think your n is a little off, because 10^(your n) - 1 is not divisible by a
 
@NathanMerrill I'd go the other way around: Consider a point on the torus. Are you convinced that each point on the torus can bijectively and continuously be mapped to a (ordered) pair of points on the curve?
 
But I did have a similar approach to what you've been saying (which is what I linked Shebang a couple of posts back)
 
yes
(or unordered)
I followed everything after his "create a surface"
 
you calculated (10^8764995592184829582976258833038704108321518306165692801758243511471338936543‌​5708‌​26847257781812) - 1?
 
7:30 PM
I get how he made the torus and how it maps to an unordered pair
 
That mod a, yes (but not that number itself of course)
 
@NathanMerrill so for each point on the torus we get a midpoint and a height
basically a single surface "above" the torus.
 
what is (10^8764995592184829582976258833038704108321518306165692801758243511471338936543‌​‌​5708‌​26847257781812) - 1 (mod 87649955921848295829762588330387041083215183061656928017582435114713389365435708‌​‌​26847257781813)?
 
@flawr true, even though a midpoint isn't unique
that makes sense
 
@NathanMerrill right, so if you fix one of the endpoints and let the other point stay variable, you geta whole surface back on the curve representation
 
7:34 PM
I think I get it now. it doesn't matter that midpoints aren't unique. If its a range of values, it'll simply make a "wall", and if its multiple values, then the curve is bending over itself
so there aren't multiple curves
 
exactly!
 
that midpoint-graph is one single curve
 
@GabrielBenamy 56877995531774003257708274747388548027343288737655866815538680056797703489900416‌​48338189910301 - you can't just assume the exponent is one less, you actually need to take the totient function
(since the modulus isn't prime)
 
god it's been so long since I've done this
but I think you're right
 
Also, when you get it the totient isn't n, it's a multiple of n
 
7:39 PM
no, I know
 
But anyhow I should really sleep now :P (if you get it, tell me if your first 10 digits are 7250379854 for double checking)
 
but when you divide (10 ^ totient) - 1 by [bignum], you get a repeating integer
the repeating portion is k, the number of digits is n
 
@TuxCopter That probably already exceeds the hardware capacity of the MacBook Pro
 
.-.
 
8:02 PM
This is probably the most meta code golf challenge ever made:
 
0
A: Sandbox for Proposed Challenges

CrazyPythonThree-way meta-quine polyglot code-golf Produce a program A such that running it in language A produces Program B, and running program A in language B produces program C. Program B, when run in language B produces Program A, and running program B in language A produces program C. Program C, wh...

 
Program | Language | Result
--------|----------|----------
A       | A        | Program B
B       | B        | Program A
A       | B        | Program C
B       | A        | Program C
C       | A        | "Wrong language!"
C       | B        | "Wrong language!"
 
2
Q: I deserve a castle for it only being Tuesday

jacksonecacIt is only Tuesday, ugh. I deserve a treat. Golf me a Castle. The Least amount of bytes wins! Taken no input and output this image exactly: /\ /\ / \ / \ ---- ---- | |^^^^^^^^^| | ----------------- | _ | | | | | | | | | | |

 
I SUMMON CHAT ACTIVITY!
 
I play pot of greed, this lets me draw 2 new cards!
 
8:11 PM
@NewMainPosts Seems like a pretty lazy kolmogorov to me :/
 
REACT TO MY SANDBOX CHALLENGE, FOOLS!
 
Stop yelling.
3
 
@Yodle from my deck which i then place into my hand
 
CMC: Output the number of times they say something along those lines in the Yugioh series.
 
CMC: Shortest google query to bring stackoverflow as the first result.
 
8:15 PM
I'd be thoroughly impressed if someone went and got all the audio from every episode and did speech recognition.
 
You can probably find transcripts out there somewhere. I've found them for lots of shows for Marky to gobble up.
Pro-tip: Don't let loose a bot trained on South Park onto SE chat :/
 
@Geobits brb doing that
 
I already did. He got chat-banned.
So I switched to Star Trek instead.
 
@Geobits I was going to ask if that was minibits or something else, but nevermind :p
 
Minibits isn't a bot o_o
 
8:18 PM
well, as long as we don't consider Geobits to not be a bot
its an all-or-nothing deal
 
Nah. Even if I were a bot, it doesn't necessarily follow that he is.
 
@noɥʇʎPʎzɐɹC stack works
 
@TimmyD so does overf
 
jonskeet is longer but seems to work too
 
@TimmyD it brings wikipedia entry for stack wtf
 
8:22 PM
@Geobits we switched the downvote and upvote constants when we made you
@betseg nope
 
Quora comes up first for me for jonskeet
 
My challenge makes you write three polyglots, golf two of them, and they have to generate each other.
 
@noɥʇʎPʎzɐɹC I don't know what you're trying to say, so I'll just ignore it, except for this message notifying you of that.
 
Goat animal is best animal
 
8:23 PM
The way to check this should be through using Google search in Incognito so Google can't tailor the results
 
@Shebang Yeah I am in incognito :P
 
@Geobits Downvote method accidentally does upvoting, vice versa for upvoting.
Program | Language | Result
--------|----------|----------
A       | A        | Program B
B       | B        | Program A
A       | B        | Program C
B       | A        | Program C
C       | A        | "Wrong language!"
C       | B        | "Wrong language!"
Golf A + B.
 
0
Q: Character by Character

Noah CristinoYour program must take in a string like: test string And must output each character adding one at a time like this: t te tes test test test s test st test str test stri test strin test string notice how spaces count! Good luck! Least Bytes win. ~N

 
Just got my first unexplained downvote on a C answer. That's a first...
 
@Dennis I guess you could say you didn't see that coming
 
8:30 PM
@Yodle he didn't C it apparently.
 
I C.
 
U P
 
Not right now, no.
 
@feersum ............... ಠ_ಠ
 
@feersum What about Michigan?
 
8:40 PM
UP isn't really Michigan though :P
 
tfw you have an answer to a challenge that gets marked as duplicate, and you go and check out the duplicate challenge and the answer there in the same language is shorter
 
@TimmyD suggestion: write in goat:
 
@Geobits I've no idea. Never been there. One of the only "Central" states I've not been to.
 
1
A: Build me a brick wall!

JordanV, 18 bytes -1 byte thanks to DJMcMayhem. 175i_|__<Esc>Ó.û70}/°ò Here it is with unprintable characters in xxd format: 0000000: 3137 3569 5f7c 5f5f 1bd3 2efb 3730 7d2f 175i_|__....70}/ 0000010: b0f2 .. Try it online!

 
@TimmyD I've never been to the UP, but I have to Michigan. They talk about it the way you would an annoying neighbor lol.
 
8:45 PM
I got out golfed in my own language
 
@DrMcMoylex That's when you know you've created a good language.
 
@Downgoat The system is rigged! I tried to downvote the goat, but I couldn't find the button that lets me do that.
 
@DrMcMoylex hey nice!
 
@Geobits ;_________;
WE GOATS TO MAKE AMERICA GOAT AGAIN ;_;
 
Of course, I took the lead back. :P
 
8:47 PM
hahaha
 
I don't want America to be goat again....
 
The American Government is garbage! Vote Goat to clean it up!
 
but duk > gaot
 
@Geobits I read that book when I was little.
 
@Adnan -1 for endorsing donald duck :P
 
@Downgoat how to upload images to gists? You've done it before...
 
@Downgoat snek > gaot > duck
 
Hilary is snek?
@noɥʇʎPʎzɐɹC git add path/to/image && git commit -m $RANDOM
 
8:51 PM
No, just a regular snake
 
@Geobits Better choice than the actual candidates imho.
 
@Adnan Woah. WTF? How did you... 59?!?
 
@Adnan -1 for endorsing significant white space :P
 
I think you've got me
 
out of curiosity, which candidate is better?
@DrMcMoylex It took me several hours though :p
@Downgoat spaces > brackets
 
8:54 PM
@Downgoat I put it on a private GH pages repo.
@Adnan clinton
 
I don't think I can take any more off
 
not including independents
 
fun fact: among the major political parties, no presidential nominee whose first name contains the letter 'K' has ever lost
 
@Adnan clinton imo, though this is most subjective question possible :P
 
8:55 PM
we should move away from policic discussion
 
@Downgoat I have heard that both are pretty bad
but I'm no expert
 
@Fatalize congrats
 
@Downgoat I don't disagree, but not even main managed to do that. I doubt chat will...
 
ProTip: host public, binary files on a private GH Pages.
 
Not sure if I'm getting to be a better golfer, or if xnor is slipping ... In the past, my PowerShell answers used to always be a handful of bytes behind his Python answers, but the past couple of challenges we've both answered (Revu'a, Pillow, Brick Wall, Hollow Square), I've actually beaten him by a couple bytes ...
I know, I know, shouldn't compare against other users (like the "outgolf Dennis" meme) ... but I couldn't help noticing.
 
8:59 PM
Heavily depends on the task. For example, Hello, World! is 5 bytes shorter in PS if memory serves.
 

« first day (2110 days earlier)      last day (2739 days later) »