Your task is make program that do following:
- You should take number. (Positive, negative, fraction is possible input)
- If it is negative, you reverse the quine. and negate that number (Become positive)
- Then you repeat <integer part of the input number> times and print first <floor(fraction part of the input number*length)> from your source program. If it is integer, then the fraction part is zero.
-10% bonus if your program isn't palindrome.
If your program is "ABCDEFG", then
ABCDEFG five times
GFEDCBA (reversed ABCDEFG) 2 times
ABCDEFG 7 times followed by ABC (first 3(floor(0.5*7)=floor(3.5)=3) letter on ABCDEFG)
GFEDCBA (reversed ABCDEFG) 0 times followed by GF (first 2(floor(0.3*7)=floor(2.1)=2) letter on GFEDCBA(reversed ABCDEFG))
<empty> here means that your program doesn't output. It is ABCDEFG zero times that is defined as empty string.