Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 62393

This challenge is intended to be solved by using, manipulating, accepting as input, or outputting numeric values.

6
votes
Husk, 7 bytes →V▼MBtN Try it online! Explanation →V▼MBtN tN list of natural numbers starting from 2 MB convert the (implicit) input to each of those bases V▼ find the (1-b …
answered Oct 25 '17 by Leo
2
votes
Builtin Husk: … Try it online! I bet this builtin exists in more than one language, so I made this a community wiki, just add in more languages where this is a builtin if you know them!
answered Oct 6 '17 by Leo
2
votes
Husk, 7 bytes ≠0ṁṠ!¡_ Try it online! Takes a list of digits as input. Still missing an "abs" builtin, but a good result all the same :) Explanation Ṡ!¡_ is a function that takes a number n and … then applies n-1 times the function _ (negation) to n. This results in n for odd n or -n for even n. ṁ applies a function to each element of a list and sums the results. ≠0 returns the absolute difference between a number and 0. …
answered Jul 10 '17 by Leo
4
votes
Husk, 6 bytes ≡ḋ3Ẋ≠p Try it online! Returns 1 for sphenic numbers and 0 otherwise. Explanation ≡ḋ3Ẋ≠p Example input: 30 p Prime factors: [2,3,5] Ẋ≠ List of absolute differences …
answered Jul 23 '17 by Leo
9
votes
Haskell, 37 bytes f 0="{}" f n=([1..n]>>)=<<["{{}","}"] Try it online! Until 10 minutes ago an answer like this would have made no sense to me. All credits go to this tips answer. Basically, we …
answered Mar 6 '17 by Leo
2
votes
, except the source code is available on the tape to the left of the starting position. Here we have the number to print in reverse at the end of the code, and we do <. four times to print all four … digits. I added a < before each . in the code (there were 3 of them), an extra <., and modified the final number. Distance should be 8. …
answered Feb 26 '17 by Leo
1
vote
real algorithm: Hwa:].$Kq H Compute absolute value w .$K While the result is not zero do: a: divide the number by 10 ] move the tape head one cell forward q Get the position of the tape head …
answered May 19 '17 by Leo
7
votes
Husk, 7 bytes →fo¬hgO Try it online! (Test suite, crashes on the last test case since it has no unique digits) This is a composition of functions in point-free style (the arguments are not mention …
answered Jun 28 '17 by Leo
1
vote
Python 2, dylnan d=lambda y:y if y%10>0 else d(y/10) lambda n:''.join([str(d(x*x))[::-1]for x in range(1,n+1)])[n-1]#fix Try it online! Note: this cop submission was bugged and didn't work for i …
answered Nov 3 '17 by Leo
19
votes
to what it was before (the input string). The remaining part removes two - separated by a newline. Then we convert the first number to unary: .* $*_ (there's a space at the end of the first line … ). We use _ as our unary digit in this case, because the standard digit 1 can be present in the second number, and this would conflict later. Now we get to the actual multiplication: _ $'$*_ Each …
answered Feb 17 '17 by Leo
4
votes
Haskell, 16 bytes (Cracked by @nimi) ()*...25=eglopxx No particular rounding
answered Apr 3 '17 by Leo
1
vote
Husk, 9 bytes ?K24Σ=ḣ3O Try it online! Explanation ?K24Σ=ḣ3O O Sort the input ? =ḣ3 If it is equal to [1,2,3]: K24 Return 24 Else: Σ Return …
answered Oct 26 '17 by Leo
1
vote
the number of characters in abs(input)) /1 W → NW → SW Pass through the mirror, then bounce agains the top O SW → NE Output the result, then bounce on the bottom left corner /1 NE → S Last mirror, I promise @ S Terminate execution …
answered May 17 '17 by Leo
11
votes
Husk, 5 bytes LCmLN Try it online! Only letters! Takes input as a string, result is 1-indexed. Explanation LCmLN mLN get the list of lengths of all positive naturals C cut the input …
answered Aug 21 '17 by Leo
20
votes
correctness Courtesy of Martin Ender This operation computes a result with one more digit than the number of digits of the two numbers together; the only operation that could produce a result so big … is exponentiation. The result is a repunit (a number whose digits are all 1). "It is know [sic] [...] that a repunit in base 10 cannot [...] be a perfect power." This means that this result can't be produced by exponentiation either. …
answered May 24 '17 by Leo

15 30 50 per page