Activity for Hakerh400
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #284501 |
The output for `("+-","",1)` should be `"++++++++++"` instead of `"++++++"`. Other test cases are ok. (more) |
— | over 2 years ago |
| Comment | Post #284516 |
... by assigning `c.length` to a variable. (more) |
— | over 2 years ago |
| Comment | Post #284407 |
*"The returning value is the method that makes the equation true"* - but then you say: *"What to return when it's false? Something but not nothing (whitespaces and newlines aren't allowed as such output)"*. So, what is the type of the return value: a function, or a character? (more) |
— | over 2 years ago |
| Comment | Post #284277 |
[67 bytes](https://tio.run/##K6gsycjPM/7/nyvRVikztyC/qEQhqzg/z7qgKDOvRENdM1EjObUi1VpdGySql1KaW1CskagZbWWlaxirrW6bqK6pZA1UkAwU/P8fAA) (more) |
— | over 2 years ago |
| Comment | Post #284271 |
Is an extra new line at the end allowed? (more) |
— | over 2 years ago |
| Comment | Post #284191 |
Are function answers allowed? Or does it have to be a full program? (more) |
— | over 2 years ago |
| Comment | Post #284195 |
[42 bytes](https://tio.run/##PcpBCsIwFEXReVbxKAiJjchvZ4UuJrWJBuprSTLpBlyAS@xGok68swN328tjZV9rGBf3nGYHDryI4wxpg@7PbCUG8NT5JXvw2plafC43l33GiOR491osRIxSYU0gIvFfBoVvW4osmhbN8Xo3Fj8FTWOMqh8) (more) |
— | over 2 years ago |
| Comment | Post #284136 |
`"+2"` is `2/1`, not `2/2`. Also, `".122122..."` is `122/999`, not `211/999` (more) |
— | over 2 years ago |
| Comment | Post #284136 |
`611107811/4950` should be negative. Can you also add `-0`, `-.`, and a few test cases with explicit `+`? (more) |
— | over 2 years ago |
| Comment | Post #284040 |
Test cases 5, 9 and 10 seem incorrect. (more) |
— | over 2 years ago |
| Comment | Post #283882 |
Does the coefficient of the highest power of x need to be 1? Can we multiply the entire polynomial by a non-zero constant? (more) |
— | over 2 years ago |
| Comment | Post #283865 |
Test cases should not be a replacement for the challenge specification. The meaning of "several variants of writing the number in English" should be precisely defined. Can we mix different variants in the same answer and/or in the same output? Where can exactly "and" appear (is "twenty and one" a val... (more) |
— | over 2 years ago |
| Comment | Post #283379 |
[An example of adding 3 arguments to a Haskell program](https://tio.run/##bY7BasMwDIbvfgrRixNYAttuCwkM1vugu5UehKOmprbVyU62UPrsmVN2GjtJ/Pr0SSeMZ3JuWay/sCTYzTGRr7dhssLBU0jKow3QwkDpVYYIXdfCRWweqGsF75h5SCeCIzvHXzYMkPgevNH0wewiGA6RHb0ohaughb3OzaN@gLU@/dZnfWgUOfIZ6NmM6@36cySZdzk1iaXQ@x4TVgE9tZvVtTnosrlba6G... (more) |
— | over 2 years ago |
| Comment | Post #283379 |
By opening DevTools console, you can easily figure out which HTML elements on TIO are responsible for adding new arguments and you can write a script to do that automatically. (more) |
— | over 2 years ago |
| Comment | Post #283337 |
The second testcase should be `-3 * 2` instead of `-4 * 2`, and the 6th testcase should be `(1 - 1) / 1 (1 - 1)` instead of `1 / 1 (1 - 1)` (and in the standard algebra it's indeterminate, not undefined). (more) |
— | over 2 years ago |
| Comment | Post #283337 |
So you're using a non-standard model of PEMDAS (see [this](https://math.berkeley.edu/~gbergman/misc/numbers/ord_ops.html))? You need to explicitly mention that in the post, and add testcase `(++++++++******)//((+++***)+++)`. Also, is division by zero undefined or 0? It can't be both. Either remove it... (more) |
— | over 2 years ago |
| Comment | Post #283337 |
What are the outputs of `()`, `+/(+-)` and `(+-)/(+-)`? (more) |
— | over 2 years ago |
| Comment | Post #283288 |
Your examples may not include subtraction and division, as the challenge explicitly states that the function must be commutative and associative. (more) |
— | over 2 years ago |
| Comment | Post #283288 |
In case you didn't know, C can take a function as an argument: [59 bytes](https://tio.run/##fc7RCoIwFAbge5/iUAQ7NiMDr5Y@SQRnm5agM5aCID77mlg3lV4MDvv4z/lVpCoyN7ctjao6ncP52eqyOdwzp0TBStMCcRZKnEbuH@JQNJaplARlsUCVShZFxBUKm7edNaDE6EhrRhwkDvD@JdiDFDAGdVf9UDhT7xd/03WmoKbSsB6HAOBhfY@CbXb6YjYcChZzAH8RUfzTZFWnr... (more) |
— | over 2 years ago |
| Comment | Post #283268 |
"... you will not be able to examine it to see how it works" - that's an uncomputable requirement. Determining whether a program examines the given function (assuming it's able to do so) is equivalent to solving the halting problem, especially in languages that need to parse a function from a string.... (more) |
— | over 2 years ago |
| Comment | Post #283146 |
`Array(99).fill()` ---> `[...Array(99)]`. Besides that, you also don't need parentheses after `join` (more) |
— | over 2 years ago |
| Comment | Post #283130 |
Then it would literally be a plagiarism of https://codegolf.stackexchange.com/a/125314 (more) |
— | over 2 years ago |
| Comment | Post #283108 |
"Given a list of positive integers" - 0 is not a positive integer (second test case). (more) |
— | over 2 years ago |
| Comment | Post #283107 |
[Cracked](https://codegolf.codidact.com/posts/283109#answer-283109) (more) |
— | over 2 years ago |
| Comment | Post #282499 |
[71 bytes](https://tio.run/##dZBNboMwEIX3nMKLKDLVBPHXJlFkbtATWKNmnAAxIjgCqxvK2akNVZtNvXqe977Rsxv6pOHS64fddeZazpWYOYEKRaGiOz24FoUkqRFINojC6UYo@U72FvXUXc2dhy8qasuutrevGH1OI4bbLc0X0w2W2XKwAxNMBswdKRNIIYMcXuEN9ghMxvA0cgv@z6Xu@pQ4Zs5KFjyOIU9gf4AsgSyH9Afw/AGOiAGegqAyPeO@DjPVWitk47KrLS2TBEyhK@qd0@@YPkyva91R... (more) |
— | almost 3 years ago |
| Comment | Post #281550 |
[31 bytes](https://tio.run/##LY7BDoIwEETv/YpJwwGiEj14IcEv0FOPSMim1tCohdgaIMZvxy162s28mdltyd/M/T7PFwoEVapK1eIKW6rkQT2u1TbP7WZXzw@yDiVYPDVIzxabA/pXUOF5dEjg226AxWoFWUDGuSgpV2UZYsu@Ftb5QE4bqMgUhtY8jcDfqkAZX5DvJa4h11yUxi8WzjC2f6TQIKRjMRWTj4Ex6vTLMFhk9jQYPVPdOU2B9/kL) (more) |
— | almost 3 years ago |
| Comment | Post #282440 |
[46 bytes](https://tio.run/##y0gszk7NyfmfZhvzP7okMTtVwVIlpSi/QKMoNTElOjNWUyVRWzuxJtNGNzGWK9FWydDE3MjUwtjMUul/bmJmnoKtQkFpSXBJkYKKQpqCnZ2tgoa2toJSTJ6S5v9/yWk5ienF/3WTCwoA) (more) |
— | almost 3 years ago |
| Comment | Post #282081 |
`[c,b]++g t` ---> `c:b:g t` (more) |
— | almost 3 years ago |
| Comment | Post #279642 |
@Arnauld. I didn't use that because the program would output an array instead of a string in case of an empty string. OP later mentioned that we don't need to cover empty strings, but I missed that. Thanks. (more) |
— | almost 3 years ago |
| Comment | Post #280839 |
@Razetime Because when `x=0` the condition `(x<2and x)` evaluates to `0`, which is falsy, so `or` can't short-circuit. (more) |
— | about 3 years ago |
| Comment | Post #280860 |
`Math.sqrt` -> `**.5` (more) |
— | about 3 years ago |
| Comment | Post #280832 |
It fails for `"AC" "ABC"` (more) |
— | about 3 years ago |
| Comment | Post #279456 |
[35 bytes](https://tio.run/##JY7BDoIwDIbvPMWyeETegIMREw8YPXgjHJoxoGFbl60SfXnnhKSHfv//Je0McdHGpITWU2DRAEPVYuRirBU5BVxxABc9RZ1YR46iFl0nF3QkS6nQaQt5sbSiln3ZSUWDzsFEZtz4ipnyPGcdduPy9gYcMJLbuPmAoUmcHm3Wzi/DuO5lKe9BzRAG2fdFYQFdPm7B34QP6Fgc/iBGsf2Vvmo0MMV0VN7/AA) (more) |
— | about 3 years ago |
| Comment | Post #280785 |
This seems very similar to https://codegolf.codidact.com/posts/279434, and some of the answers would [literally work](https://tio.run/##TY1LCoMwFEXnWcUddJDg66DVfhBcQlcQggTxVWmUkGT9TY2D4uhwf9zJxs/oXM4s5dQm1QbVTS3LUFU6GSVY9sViBMHoO21yGmOK6KAFoPWFcCXUhqAbwo1wN4b@SbFrQlO4ZxsfhOexc1gXbnsjxGLndftYrH/Bh3lNO... (more) |
— | about 3 years ago |
| Comment | Post #280650 |
@rak1507 I updated the answer to cover the `[[0, 1, 0], [1, 0, 0], [0, 0, 0]]` case, but I think you need to provide a better definition of what you mean by "diagonal". From your examples I thought that that particular test case that you show should return 0 and not 1. You probably should provide mor... (more) |
— | about 3 years ago |
| Comment | Post #280408 |
"in most" does not mean "in all". Many esoteric languages do not have a clear notion of what a comment is. (more) |
— | about 3 years ago |
| Comment | Post #280408 |
"The source may not contain comments" - that is unobservable. (more) |
— | about 3 years ago |
| Comment | Post #279854 |
The challenge has been updated. (more) |
— | over 3 years ago |
| Comment | Post #279854 |
@celtschk String `s` is indeed the normalized string representation, but figuring that out was intended to be a part of the challenge. Regarding the order of the mapping, what's the point of mentioning that the order is not preserved? If `f` stands for converting number to set and `x,y` are natural n... (more) |
— | over 3 years ago |
| Comment | Post #279854 |
@Moshi Two separate programs are allowed now. (more) |
— | over 3 years ago |
| Comment | Post #279854 |
@celtschk Added link to "hereditarily finite" wiki article, hope all concerns are addressed now. Regarding the spaces, they are optional (mentioned that in the post, thanks). BTW, the algorithm does not produce a string, it produces a set (it says *"interpret `s` as a set and return it as the result... (more) |
— | over 3 years ago |
| Comment | Post #279854 |
@celtschk The decision to avoid terms "rank" and "hereditary finite" was intentional, because they involve transfinite recursion and depend on set-theoretic axioms. The post is now edited, please let me know if the definitions are still misleading. Also, this is not the Ackermann bijection (6 is a c... (more) |
— | over 3 years ago |
| Comment | Post #279854 |
@Razetime Please let me know if any recursive definition is missing a base case. (more) |
— | over 3 years ago |
| Comment | Post #279778 |
Shouldn't 12345 look like [this](https://raw.githubusercontent.com/Hakerh400/test/2e83e758bb87b155f223170d905c0b2901e9f238/2.txt)? (more) |
— | over 3 years ago |
| Comment | Post #279684 |
A language whose empty program outputs 256 has unbounded score, as someone can submit any number of empty programs as separate solutions (indeed solutions do not share any characters). Either explicitly mention that solutions must be distinct, or forbid empty programs. (more) |
— | over 3 years ago |
| Comment | Post #279659 |
Computing the length of the longest finite output is called the Busy beaver function. It grows faster than any computable function. Even if you take the logarithm of the output length, or super-logarithm, or divide it by Ackermann function, or any other computable postprocessing, the quotient outputl... (more) |
— | over 3 years ago |
| Comment | Post #279621 |
It prints `2` for `[7,1,9,3,8,5,4,6,2]`, but the subsequence `1,3,5,6` has length 4. (more) |
— | over 3 years ago |
| Comment | Post #279255 |
44 bytes: `a=lambda x,y:(x>=0)*(1if y<0else 1+a(y,x-y))` (more) |
— | over 3 years ago |
| Comment | Post #279231 |
"The number of bytes used" is undefinable. Checking any non-trivial property of a program is uncomputable. Besides that, the scoring formula U^2/B allows the score to grow without bounds. JS example: `console.log(/*/)/**/1+1...+1+1/**/)/*/(gol.elosnoc` - replace `...` with `+1` repeated n times, the ... (more) |
— | over 3 years ago |