CMP: Should strings in Proton be primitives (faster, probably easier for me) or represented as lists of numbers (slower, probably more memory-inefficient, probably harder for me, but follows the Proton structure of only numbers+lists being Python objects)?
I prefer just making it primitives because a) I'm lazy and b) I want this to actually work.
Find unique elements based on given key
Input
Take a list of values xi each paired with a key yi.
[(x1, y1), (x2, y2), ...]
Output
Return a list of values from {xi} such that for each unique key k in {yi} there exists exactly one xi in the list that has key k.
Details
You can assume al...
@Zacharý I was close. deset2 is the problem... it does deset0(u) before deset0(v)... (unless args are already passed in reverse?) (this is the same with deset3)
That means that the left is getting evaluated before the right (Or () causes premature evaluation, but I have no way of testing between the two), but I've tried changing everything I think would cause that, and still I get 4
ok. now in RAD.py under NFN change res_V = S[1].value(S[0].value, deset0(S[2].value)) to res_V = print(S[0].value, S[2].value) or S[1].value(S[0].value, deset0(S[2].value))
Anyone see any more microoptimizations for https://codegolf.stackexchange.com/a/163215/77964 ? I'm flat out stumped now. Beginning to think it's at minimum size
I usually check manually. The byte size of commands is in the documentation, but it's highly variable, even the smallest things can add or remove bytes
We define the function g as g(n) = n XOR (n * 2) for any integer n > 0.
Given x > 0, find the smallest integer y > 0 such that gk(y) = x for some k > 0.
Example
x = 549
549 = 483 XOR (483 * 2) (as binary: 1000100101 = 111100011 XOR 1111000110)
483 = 161 XOR (161 * 2) (as binary: 1111...
Does anyone know what's the shortest way to have lambda function in Java (for example when you need recursion or to do the same thing in different positions)
yay :D https://tio.run/##7T3bdtvIkc/SV7TpjERQvEi2k0lIST6SSXl4jkw5opSZieXhgUhQwhoEuABoSZnoZb8hj/t1@ZCdraq@oBsAQcoSHe/ZZE4sotFVXV1dXbe@YDid1q6Gw99@e@76Q282ctiuG0Rx6NiT/fWkbGJP9ccotoef9ILLAIAannPrDm1vMLSjuH49nWZrzGLXc@O7BrTg@leD0Bnn17O9qyB04@uJqNkAlM5gGPifZf3xyBmzH7u99smPfQ38R9cfBTdR/RrqOP7IHa8/n/lYtXd@fLz@HH65vsPO3w/KtxajtprNOBjMplMnBPzTO@jbqNnkre6XtQcAsDQECK@/fTAua3290WBnJ@2TJru0I3fIoHvAWD9m48AbQS1WjoIwvKsyP4gZ/bQSkFHAugyGyfPumO84IxYHbBY58PvmNQMaRyyYxcz1WXyNhbcxc6ZuFACPgjEbhfZV4EOznpdgHLu3UH/kDp2oypxoWkdo53YaJlWiOz@2b5kThkEo3q6v@/YEattDh/35kPrx6/r6muPPJmzo2VHE@rEdO1C4ttY7OX13cFyFX0fnvTdn3ZPe…
I was trying to explain to someone that C is Turing-complete, and realized that I don't actually know if it is, indeed, technically Turing-complete. (C as in the abstract semantics, not as in an actual implementation.)
The "obvious" answer (roughly: it can address an arbitrary amount of memory,...
> With unbounded recursion depth, and the restriction that a function can only get data from its direct caller (register arguments) and return data to its direct caller (the function return value), you get the power of deterministic pushdown automata.
Each recursion level can only access finite memory.
So, I have an array
['a', 42, 'b', 42, 'a']
I want to alert users to the fact that 42 and 'a' appear in it twice.
some_function(['a', 42, 'b', 42, 'a'])
should return
['a', 42]
Write some code to extract the duplicates from an array.
It should accept an array as input.
The array can ...
I want to import a CSV file into r but it takes the date column and creates a new column for it then renames the next column date and the column after that the name that should of been assigned to the second columns (see pictures). how do I prevent this from happening. I am very new to r.
Here i...
If I do give suggestions on how to improve the questions assume it's on Stack Overflow, OP will think that it needs to be improved and then it can be ontopic here, not good. If I don't, somebody else on Stack Overflow will and ...
Hexagony, 2437 bytes
The long-awaited program is here:
(.=$>({{{({}}{\>6'%={}{?4=$/./\_><./,{}}{<$<\?{&P'_("'"#<".>........_..\></</(\.|/<>}{0/'$.}_.....><>)<.$)).><$./$\))'"<$_.)><.>%'2{/_.>(/)|_>}{{}./..>#/|}.'/$|\})'%.<>{=\$_.\<$))<>(|\4?<.{.%.|/</{=....$/<>/...'..._.>'"'_/<}....({{>%'))}/.><...
@AdmBorkBork "2) [...] and write code that takes no input and outputs the code from the first half of the problem" so Python_code should output Jelly_code when run?
the thing about log is that you're passing to the real numbers. real numbers don't have decidable equality, let alone decidable order, whereas a^b<c^d is obviously decidable
Input
Take a list of values xi each paired with a key yi.
[(x1, y1), (x2, y2), ...]
Output
Return a list L containing only values from the set {xi}.
The length of L must be equal to the number of unique keys k in the set {yi}.
For each unique key k there must be a value from {xi} that has...
the thing about log is that you're passing to the real numbers. real numbers don't have decidable equality, let alone decidable order, whereas a^b<c^d is obviously decidable
Seriously, I believe the best way is to (1) use log approximation (2) if they're sufficiently near check if they're equal (by taking the gcd of a and c etc.) (3) if they're not equal then compute full precision.
Find unique elements based on given key
Input
Take a list of values xi each paired with a key yi.
[(x1, y1), (x2, y2), ...]
Output
Return a list of values from {xi} such that for each unique key k in {yi} there exists exactly one xi in the list that has key k.
Details
You can assume al...
We define the function g as g(n) = n XOR (n * 2) for any integer n > 0.
Given x > 0, find the smallest integer y > 0 such that gk(y) = x for some k > 0.
Example
x = 549
549 = 483 XOR (483 * 2) (as binary: 1000100101 = 111100011 XOR 1111000110)
483 = 161 XOR (161 * 2) (as binary: 1111...
