Post History
Challenge idea taken from: Eliseo D'Annunzio Task Provide code that evaluates to 0.5 numerically, i.e. the output must be recognized by your chosen language as a numeric value (Number, float, dou...
#2: Post edited
by
Moshi
·
2022-02-09T12:12:27Z (about 2 years ago)
Added scoring tag (for the leaderboard)
Can you give me half?
**Challenge idea taken from:** [Eliseo D'Annunzio](https://codegolf.stackexchange.com/questions/230111/can-you-give-me-half-no-digits) # Task Provide code that evaluates to 0.5 numerically, i.e. the output must be recognized by your chosen language as a numeric value (Number, float, double, etc), not as a string. The catch, the characters 0 through to 9 cannot be used. One example that fits the brief would be the following: `((++[[]][[~~""]]<<++[[]][[~~""]]))**((--[[]][[~~""]]))` which works out to 0.5 in JavaScript. # Scoring This is a code challenge, where scoring is done in terms of number of unique characters used in the submission. Ties are broken by lowest bytecount.
#1: Initial revision
by
Razetime
·
2022-02-09T11:26:37Z (about 2 years ago)
Can you give me half?
**Challenge idea taken from:** [Eliseo D'Annunzio](https://codegolf.stackexchange.com/questions/230111/can-you-give-me-half-no-digits) # Task Provide code that evaluates to 0.5 numerically, i.e. the output must be recognized by your chosen language as a numeric value (Number, float, double, etc), not as a string. The catch, the characters 0 through to 9 cannot be used. One example that fits the brief would be the following: `((++[[]][[~~""]]<<++[[]][[~~""]]))**((--[[]][[~~""]]))` which works out to 0.5 in JavaScript. # Scoring This is a code challenge, where scoring is done in terms of number of unique characters used in the submission. Ties are broken by lowest bytecount.