i dont know maybe because it shows up when i google "python dict docs"
and if its the tutorial why does it list the methods of list and just discuss what a dict is?
i mean at least have a seperate section for list and dict instead of putting list docs in the tutorial and half of dict docs in tutorial and somewhere else
It turns out googling an unusual keyword from the description of a Youtube video with few views (but not too few) is the best way to get a list of malicious sites from Google
CMC: Given a binary number, remove trailing 0's, replace 1's with i's, replace any run of 0's with a single +. Evaluate the resulting complex equation. e.g. 38 = 100110 -> i+ii = i+i^2 = -1 + i
@Calvin'sHobbies Surely a terrible solution that can totally be golfed, but Python 3, 123 bytes: lambda n:eval(bin(n)[2:].replace('1','1j').replace('j1','j*1').replace('j0','j+0').replace('01','0+1').replace('00','0+0')).
Im just throwing around concepts, but what about an MMO version of Risk where you can trade between conquered cities, and produce defended for those cities and stuff?
TBH, the 3-player TTT thing was for designing a massive KoTH with everyone playing the same game.
Let's create a simple, surjective mapping from positive integers to Gaussian integers, which are complex numbers where the real and imaginary parts are integers.
Given a positive integer, for example 4538, express it in binary with no leading 0's:
4538 base 10 = 1000110111010 base 2
Remove an...
@Calvin'sHobbies I...don't really know/remember what I was expecting.
Hmm. Lessee... n%p=q means that n=pk+q. Then 3%2j would be 3=2j*k+q, but I guess there are an infinite number of solutions. Oh, a further constraint to give a unique solution is that 0 <= q < p, and that's why modding by complex numbers doesn't work: there's no good way to order complex numbers.
Thinking outside the box - Am I doing it right?
I keep hearing that thinking outside the box is a goal worth achieving, but how can I tell if I'm successfully doing it?
To solve this dilemma I have already wrote a Brainwave-to-ASCII-translator which in theory should produce outputs like
######...
i mean at least have a seperate section for list and dict instead of putting list docs in the tutorial and half of dict docs in tutorial and somewhere else
There are 10 types of people in the world: Those who can't number, those who know binary, those who know ternary, those who know quaternary, those who know quinary, those who know senary, those who know septenary, those who know octal, those who know nonary, those who know decimal, those who know undecimal...
Crack my regex: does https?:\/\/www\.google\.com\/.*[?#]q=(\w*\.x).* match & capture every google search URL with the query ending in [alphanumeric chars].x (as in the url bar) possible, and no more?
I don't know about calling Python docs great, but they seem as normal as every other major language doc I've seen. I wouldn't call them bad though, personally.
If I had to gripe about language docs, I'd probably pick Java :P
When you checkout a branch, all files within the repo are changed, added, or deleted to match the state of that branch so you can do whatever work you like, then commit when you're done.
Per "A Clone of My Own"
Farnsworth: These are the dark matter engines I invented. They allow my starship to travel between galaxies in mere hours.
Cubert: That's impossible. You can't go faster than the speed of light.
Farnsworth: Of course not. That's why scientists increased the s...
This is a cops and robbers challenge - Cop's Thread
Each of the cops have been tasked to write a program that terminates after exactly 60 seconds, or as close as possible. For example:
#include <unistd.h>
int main(int argc, char **argv){
sleep(60);
return 0;
}
Your goal is to take any...
Got it! "Random shuffling actually is a valid way to meet the criteria, and I'll alter the question to reflect that"
Language laywer'd... going to post :)
Wait... catching myself... the question here was about the slope of consecs... not repetitions... I think this implies he's accepting this though (sigh, I'm glad I'm not a lawyer though)
@Dennis that's the exact opposite of Anarchy Golf's rule, which is "your program must successfully complete all the test cases on the same run at least once"; that's lead to some creative loophole abuse in which people do things like encode a constant using the current time
it's interesting to see the differences between sites sometimes
one of my favourite Anarchy Golf questions ever had three test cases with identical inputs but different outputs
There's a post Perez made in answer to a comment that says "Random shuffling actually is a valid way to meet the criteria"... I'm pulling my hair out trying to interpret that though, because it suggests that Greg's solution is fine (and that my approach would be okay, which does a similar thing algorithmically)
@Dennis I guess we're a little conflicted on that because we require answers to work on all valid inputs in theory, accepting answers that'd take far too long or require far too powerful a computer to do it in practice, but we define languages by the implementation
it'd seem to make more sense to define languages by the spec, if we can't check the correctness of a program by running it
@ais523 Yeah, that's a bit odd. The problem is coming up with conditions under which the program must work. How long is it allowed to take? On which architecture? How much RAM can it use? How do you measure that? Etc.
for PPCG, I think it'd make more sense if you could run the system on any computer you had access to, but you must actually either execute the program yourself or find someone else to do so
one of the reasons that'd be good is that it'd encourage golfing language implementations to be more efficient
so that the crazy O(n!) programs that people come up with half the time could be optimized into something less ridiculously slow by the interpreter, making them legal
It's probably rare, but we had a few black sheep. People who hosted their implementation on a web server without access to a history, for example, who later modified their interpreter before writing an answer and claimed a low byte count.
Also, the reason we define languages by their implementation is to avoid the this doesn't actually work, but that's because <insert subjective interpretation of the language spec> scenarios that would arise otherwise. Even if you can't actually run the program, you can usually tell if it would work given enough time and memory. Specs are harder to interpret than code.
now I'm trying to figure out how to create an esolang to reverse that dynamic ;-)
it's hard, though, mostly because interpreters tend to be written in programming languages, and specs tend to be written in English, and one language is much more ambiguous than the other
it happens in interpreter-chain scenarios, though
like, the behaviour of the interpreter depends on the interpreter that's used to run the interpreter
and if you allowed arbitrary interpreter chains, you could figure out a way to encode a program in them
brainfuck (Unreadable Brainfuck), 9 bytes
,+[-.,+]!
Append the input to the end. There isn't a trailing newline, this time.
Looking for languages which would accept input appended to the end of the program, brainfuck seemed like a distinct possibility; many brainfuck interpreters written in e...
the EOF behaviour of the Unreadable interpreter ends up determining how golfed the brainfuck program can be
actually, it's fairly simple to write a language with two self-interpreters and a third interpreter written in some other language, such that you could make the null program do anything
it would be useful for exploiting loopholes in programming contest questions but not much else
actually, it's fairly simple to write a language with two self-interpreters and a third interpreter written in some other language, such that you could make the null program do anything
@ais523 Or you could do it with two interpreters: encode program in Unary, recursively run the null program through the first interpreter that many times, and then run it in the other interpreter
I'm trying to implement a Tetris solver in Minizinc, which is also known as the "packing" problem I suppose.
I'm brand new to Minizinc and have barely any idea what I'm doing, but I'm currently stuck on a particular constraint in my code.
I am trying to solve a 4x4 square by placing 4 "l" block...
math problem I just thought of: let's say that I had a cube and I wanted to make a 6-sided die out of it. Instead of drawing dots (like the pips on a normal die), I want to draw curves (in the form of closed loops that travel across/around the faces of the cube). The number of curve segments on a particular face is that face's value.
it doesn't matter; any solution where they do, just reverse the direction of the curve at the crossover point, then you can separate the previously crossing parts
My wires are all tangled!
Isn't it annoying when wires get all tangled up? Well, that just happened to me, so I'd like to to help me untangle them! For your convenience, I've disconnected them all from the device, but they're all still connected to the outlet. Your challenge is to figure out how...
math problem I just thought of: let's say that I had a cube and I wanted to make a 6-sided die out of it. Instead of drawing dots (like the pips on a normal die), I want to draw curves (in the form of closed loops that travel across/around the faces of the cube). The number of curve segments on a particular face is that face's value.
Let's create a simple, surjective mapping from positive integers to Gaussian integers, which are complex numbers where the real and imaginary parts are integers.
Given a positive integer, for example 4538, express it in binary with no leading 0's:
4538 base 10 = 1000110111010 base 2
Remove an...
Thinking outside the box - Am I doing it right?
I keep hearing that thinking outside the box is a goal worth achieving, but how can I tell if I'm successfully doing it?
To solve this dilemma I have already wrote a Brainwave-to-ASCII-translator which in theory should produce outputs like
######...
Per "A Clone of My Own"
Farnsworth: These are the dark matter engines I invented. They allow my starship to travel between galaxies in mere hours.
Cubert: That's impossible. You can't go faster than the speed of light.
Farnsworth: Of course not. That's why scientists increased the s...
This is a cops and robbers challenge - Cop's Thread
Each of the cops have been tasked to write a program that terminates after exactly 60 seconds, or as close as possible. For example:
#include <unistd.h>
int main(int argc, char **argv){
sleep(60);
return 0;
}
Your goal is to take any...
brainfuck (Unreadable Brainfuck), 9 bytes
,+[-.,+]!
Append the input to the end. There isn't a trailing newline, this time.
Looking for languages which would accept input appended to the end of the program, brainfuck seemed like a distinct possibility; many brainfuck interpreters written in e...
