Skip to main content
Code Golf

Return to Answer

deleted 1 character in body
Source Link
Erik the Outgolfer
Erik the Outgolfer
  • 40.8k
  • 1
  • 25
  • 40

Allow solutions to assume input will be within their language's bounds

For example, if a language can't represent 2^-20 (~1.035264923841377504347788194211246) (where ^ is exponentiation) as a floating-point number, with any settings set for the particular solution, then the solution can assume it won't be ever passed in as inputneeded to be used. However, the algorithm used must theoretically work for all possible inputs.

Another example would be a division by zero that shouldn't happen because normally the divisor wouldn't be 0 but a float which got rounded to 0 because of bounds, or some digits of a float being rounded because of bounds.

However, if the float is rounded because of your algorithm or such rounding is meant to be done in your language and isn't unintended, then your answer would be invalid, since the rounding would be part of your algorithm.

Allow solutions to assume input will be within their language's bounds

For example, if a language can't represent 2^-20 (~1.035264923841377504347788194211246) (where ^ is exponentiation) as a floating-point number, with any settings set for the particular solution, then the solution can assume it won't be ever passed in as input. However, the algorithm used must theoretically work for all possible inputs.

Another example would be a division by zero that shouldn't happen because normally the divisor wouldn't be 0 but a float which got rounded to 0 because of bounds, or some digits of a float being rounded because of bounds.

However, if the float is rounded because of your algorithm or such rounding is meant to be done in your language and isn't unintended, then your answer would be invalid, since the rounding would be part of your algorithm.

Allow solutions to assume input will be within their language's bounds

For example, if a language can't represent 2^-20 (~1.035264923841377504347788194211246) (where ^ is exponentiation) as a floating-point number, with any settings set for the particular solution, then the solution can assume it won't be ever needed to be used. However, the algorithm used must theoretically work for all possible inputs.

Another example would be a division by zero that shouldn't happen because normally the divisor wouldn't be 0 but a float which got rounded to 0 because of bounds, or some digits of a float being rounded because of bounds.

However, if the float is rounded because of your algorithm or such rounding is meant to be done in your language and isn't unintended, then your answer would be invalid, since the rounding would be part of your algorithm.

Source Link
Erik the Outgolfer
Erik the Outgolfer
  • 40.8k
  • 1
  • 25
  • 40

Allow solutions to assume input will be within their language's bounds

For example, if a language can't represent 2^-20 (~1.035264923841377504347788194211246) (where ^ is exponentiation) as a floating-point number, with any settings set for the particular solution, then the solution can assume it won't be ever passed in as input. However, the algorithm used must theoretically work for all possible inputs.

Another example would be a division by zero that shouldn't happen because normally the divisor wouldn't be 0 but a float which got rounded to 0 because of bounds, or some digits of a float being rounded because of bounds.

However, if the float is rounded because of your algorithm or such rounding is meant to be done in your language and isn't unintended, then your answer would be invalid, since the rounding would be part of your algorithm.