Solving the Snail's jurney challange

Created by Donthack @ v9.2 (4/11/2018)

About the inputs:
the value of the "A" : the snail climbs up these metres daily on a tree.
the value of the "H" : the Height of the tree (so the top of the tree, in metres).
the value of the "B": the snails slides back these metres at every night (from the daily reached actual position).

(This back-sliding isn't like in the reality, because of in the RL the snails can stick so bad to a position. hahahaha 😂)

Assume: H > A > B

Examples:

Examples

try	inputs	outputs	code works or not
1	15, 1, 0.5	29 days	yes
2	2, 1, 0.9	11 days	yes
3	2, 1, 0.8	6 days	yes
4	2, 1, 0.6	4 days	yes

Insert your inputs:

Write inputs:	You wrote:

The pure result of the count:

The result of the count (with the correction):

The process of the count:

var starteddays=(height.value-slide.value)/(climb.value-slide.value);

Pure result:
var resultDaysShV=starteddays;

Result with the correction:
if (starteddays>(parseInt(starteddays)+0.0001)){ var starteddaysWCorr=(parseInt(starteddays)+1); }

else if (starteddays=(parseInt(starteddays))){ var starteddaysWCorr = starteddays ; }

[CHALLENGE] The Snail's Jurney - v9.0