@Mr.Xcoder also most haskellers like to use div, mod, elem as infix functions because it's easier to tell which argument is which (5 `div` 2 is more obvious than div 5 2)
I did extrmely well on the ACT, but my GPA is kinda crap, so now I'm getting all this mail from univirsities I don't actually have a chance of getting into inviting me to apply :(
@Pavel GPA really doesn't matter, I mean your grades should be generally B or above but if you have exceptional ability and passion I don't think you should hesitate to apply to top universities
@Zacharý Over here we have certain schools that you can apply to and get in by lottery called choice schools. They're generally much better than the regular public schools.
Ahhh, that makes sense as to how everything's honors or AP. But I would expect that they would offer classes that are normal, for people who SUCK at something (like my writing)
The fact that a group of people would pressure for something like that, seems very foreign to me. Where I live, ..., let's just leave it as that sounds foreign
It might be useful to keep the question undeleted. That way it serves as a way to more easily find the question it is a dupe of. - Heeby Jeeby Man
The question is all in the title:
Must askers be able to answer their own question?
EDIT:
As PeterTaylor pointed out below, this question ...
@MDXF By negating the conditional (using <8 instead of >7), you can swap the order of the branches, and avoid the parenthesis. That gives you (s[e]<8?s[e]&1:2)
Average Alphabet
code-golf
Introduction
We can average a number using this formula:
(1st term + 2nd term + ... + nth term) / no. of term
But unfortunately, this does not apply to alphabets
Challenge
Your program should take an input as a string, which is one-line & alphabet only. Other ...
Regrowing trees
code-golf tree-traversal
Background
Just another work-inspired challenge. Imagine you have a service that returns the list of nodes in a tree structure (much like the files and folders in a file system), but in no particular order. For every node you get a tuple with its name a...
@Adám it would be 2 bytes shorter in Python if string were written using double-quotes using __repr__ but unfortunately I need to quote it because otherwise it won't be right :(
and also :[space] and ,[space]
I was typing my history essay yesterday and I finally get now why people like mechanical keyboards so much :P
I don't actually have access to a mechanical keyboard for typing using my computer because the mechanical keyboard I have right next to me when I use my computer has the wrong type of plug and can only be plugged into the really old (like probably 10 year old) computer that still runs Windows Vista
@dzaima OK, that's a beginning. And we also need a < to confuse PHP, right?
Anonymous
@Adám Such a string doesn't exist if you use the current site rules, rather than the (IMO sane) rule of only allowing programming languages. If you restrict it further to TC languages, it would be very interesting :)
wait so I think I finally understand the inequality, so essentially if the string has length n then it has to take strictly more than n bytes to output it in any language?
it would be massively different though, since we gotta print numbers (the print num operator also adds the space for us for free)
Anonymous
@Unihedron So cracking MT19937 isn't actually all that hard. If you have 624 consecutive 32-bit values generated by the PRNG, you can determine all previous and future values. By also knowing the number of random values produced prior to those 624, you can determine the initial seed.
@user202729 well, kind of, except it can't be a Befunge quine because it needs to print the seed program itself, not the twisted Befunge program itself
@Mego This is valuable information and it is consistent with my ~10 minutes of googling, I found a github repo that implements this but I was unsure of / stuck on how to get said set of random values, or how to scale my program into a list of random values into the right places
@Unihedron Forgot to say, the input format: first number = number of bytes, other numbers: base-(2^32) digits of the seed. That corresponds to the Seed Hello World program.
with this we can cut on the amount of "rejected" quines significantly, since we can print a lot of more valid numbers for the first output in the befunge
I doubt it but I don't know. Also I don't know of any unblocked proxy sites anymore because the school board is blocking them more quickly than they're being created
@Adám ok, 65536 langs, if first 2 bytes are "", output the rest of the code plus the language ID decoded to 2 bytes, otherwise interpret as brainfuck. :P
Also, another challenge to writing a quine in Seed: the PRNG is seeded with a single 64-bit value, so the seed is stretched to fill the initial state. This means that the initial states that can be obtained is a very small subset of all possible initial states. It's entirely possible that none of those initial states can produce satisfactory sequences of values.
which would also explain why no one has done it yet
but think about how spectacular it would be though, a language that runs on and generates code in another language that prints its own source code in the source language
soon: Seed^2
Anonymous
Because of the loss of information (32 bits to 8 bits) in character generation, you need a lot more information to determine the state, so the Befunge code will have to be very long.
Also, considering the fact that the seed will unlikely to have very few digits, the befunge code is going to be very long
to generate that exact number
the efficient methodology would be to run all the code we generate to compare, but I don't have the power to do that, so I'd rather employ tricks like quickfail for code (e.g. that doesn't print anything) and manually sort through candidates
Anonymous
2:23 PM
Trying to brute-force a quine would take a very, very, very long time
The security of public key cryptography relies on computers not being able to generate anywhere near 2256 guesses per any reasonable time length. The obvious implications of a computer this powerful would be that Bitcoin and all other cryptocurrencies would be hacked immediately. But what other l...