Negadecimal, also known as base -10, is a non-standard positional numeral system. Take the number \$1337_{10}\$. In decimal, this has the value one thousand three hundred thirty seven, and can be expanded to: $$1\cdot10^3+3\cdot10^2+3\cdot10^1+7\cdot10^0$$ $$(1000)+(300)+(30)+(7)$$ In negadecimal...

code-challenge combinatorics grid fastest-code Counting Battleships boards Battleships is a game in which one player lays out a number of shapes ("ships") on a board (typically 10×10) and the other player then fires at them. This challenge concerns not the gameplay but the creation of boards. In ...

Don't be a coward and write an OS in least number of bytes! Who's the first gets 1000 reputation who's the last is n166a and m0ţH37𝑓ück37! Common, dudes, prove me yall are real Americans!\/\/ 3 5 1 3 y __ @wood

Which answer did this user write? answer-chaining code-golf restricted-source This is an answer-chaining challenge where each answer must take an integer \$N\$ as input and return the 1-indexed ID of the answer which was written by the user whose ID is \$N\$. Rules I will post the first answer....

Golfing on a Budget answer-chaining restricted-source The Task Every answer should take a positive number as input, and print/return every number in reverse down to zero (inclusive), in any reasonable format. For example: 10 -> "10 9 8 7 6 5 4 3 2 1 0" 8 -> [8, 7, 6, 5, 4, 3, 2, 1, 0] 1000 -

Given a non negative integer number n output its perfect radical. Definition A perfect radical r of a number n is the lowest integer root of n of any index (degree) i. $$r = \sqrt[i]{n}$$ In other words i is the maximum exponent such that r raised to i is n. $$n = r^i$$ Special cases For n = 1 an...

I don't like curry I don't like curry. Help me reverse the effects of this evil question - Make me some curry. Task Given a blackbox curried function, output its uncurried equivalent. The curried function will take a single argument and output either another curried function or a value of anothe...