Note: This is the cops' thread, where one should post the scrambled code. Here is the robbers' thread where the cracked source should be posted and linked to the cop's answer.
Task: Write the shortest safe program which multiplies the square root of an integer n by the square of n
This is cops-and-robbers, so the rules are:
- In your answer, post a scrambled version of your source code (the characters should be written in any order). The scrambled version should not work!
- You can take input in any standard way, the same goes for output. Hardcoding is forbidden
- After the code is cracked by the robbers (if this happens), you must mention that your code has been cracked in your title and add a spoiler to your answer's body with your exact code
- The same applies to safe answers (mention that it's safe and add the spoiler)
- The code is considered safe if nobody has cracked it in 5 days after posting it and you can optionally specify that in the title
- You must specify your programming language
- You should specify your byte count
- You must state the rounding mechanism in your answer (see below)
You can assume that the result is lower than 232 and n is always positive. If the result is an integer, you must return the exact value with or without a decimal point; otherwise the minimum decimal precision will be 3 decimal places with any rounding mechanism of your choice, but can include more. You must state the rounding mechanism in your answer. You are not allowed to return as fractions (numerator, denominator pairs - sorry, Bash!)
In -> Out 4 -> 32.0 (or 32) 6 -> 88.18163074019441 (or 88.182 following the rules above) 9 -> 243.0 25 -> 3125.0
The shortest safe answer by the end of April will be considered the winner.